A natural partial order on certain semigroups of transformations with restricted range

Let V be any vector space and P(V) the set of all partial linear transformations defined on V, that is, all linear α: A → B, where A, B are subspaces of V. Then P(V) is a semigroup under composition, which is partially ordered by ⊆ (that is, α ⊆ β if and only if dom α ⊆ dom β and α = β | dom α). We compare this order with the so-called 'natural partial order' ≤ on P(V) and we determine their meet and join. We also describe all elements of P(V) that are minimal (or maximal) with respect to each of these four orders, and we characterize all elements that are 'compatible' with them. In addition, we answer similar questions for the semigroup T(V) consisting of all α ∈ P(V) whose domain equals V. Other orders have been defined by Petrich on any regular semigroup: three of them form a chain below ≤, and we show that two of these are equal on the semigroup P(V) and on the ring T(V). We also consider questions for these orders that are similar to those already mentioned

It is well-known that on an inverse semigroup S the relation ≦ defined by a ≦ b if and only if aa−1 = ab−1 is a partial order (called the natural partial order) on S and that this relation is closely related to the global structure of S (cf. (1, §7.1), (10)). Our purpose here is to study a partial order on regular semigroups that coincides with the relation defined above on inverse semigroups. It is found that this relation has properties very similar to the properties of the natural partial order on inverse semigroups. However, this relation is not, in general, compatible with the multiplication in the semigroup. We show that this is true if and only if the semigroup is pseudo-inverse (cf. (8)). We also show how this relation may be used to obtain a simple description of the finest primitive congruence and the finest completely simple congruence on a regular semigroup.

On a Class of Lattice Ordered Inverse Semigroups

Let X be an infinite linearly ordered set and let Y be a nonempty subset of X. We calculate the relative rank of the semigroup of all orientation-preserving transformations on X with restricted range Y modulo the semigroup of all order-preserving transformations on X with restricted range Y. For Y = X, we characterize the relative generating sets of minimal size.

We introduce a preorder on an inverse semigroup S associated to any normal inverse subsemigroup N, that lies between the natural partial order and Green’s $${\mathcal {J}}$$ –relation. The corresponding equivalence relation $$\simeq _N$$ is not necessarily a congruence on S, but the quotient set does inherit a natural ordered groupoid structure. We show that this construction permits the factorisation of any inverse semigroup homomorphism into a composition of a quotient map and a star-injective functor, and that this decomposition implies a classification of congruences on S. We give an application to the congruence and certain normal inverse subsemigroups associate to an inverse monoid presentation.

The absolute order on the symmetric group, constructible partially ordered sets and Cohen–Macaulay complexes

This work presents efficient algorithms to update knowledge bases in the presence of integrity constraints. The algorithms ensure that the changes to the knowledge bases are minimal. We use the deductive database paradigm to represent knowledge. Minimality is defined as a natural partial order over possible models of the database and expresses a preference for data explicity stored in the database over the data deduced by default. This requirement seems rational for many applications and yet it is hard to be expressed with a set of integrity constraints. We handle safe negation and local variables in the bodies of the rules. We tackle the issue of modifying the active domain (i.e. adding new constants or removing some of the constants which are present in the knowledge base), and we demonstrate how interaction with the user can be used to handle recursive definitions.

Several modules M over algebras with straightening law A have a structure which is similar to the structure of A itself: M has a system of generators endowed with a natural partial order, a standard basis over the ring B of coefficients, and the multiplication A × M → A satisfies a “straightening law”. We call them modules with straightening law, briefly MSLs. In section 1 we recall the notion of an algebra with straightening law together with those examples which will be important in the sequel. Section 2 contains the basic results on MSLs, whereas section 3 is devoted to examples: (i) powers of certain ideals and residue class rings with respect to them, (ii) “generic” modules defined by generic, alternating or symmetric matrices of indeterminates, (iii) certain modules related to differentials and derivations of determinantal rings. The essential homological invariant of a module is its depth. We discuss how to compute the depth of an MSL in section 4. The main tool are filtrations related to the MSL structure. The last section contains a natural strengthening of the MSL axioms which under certain circumstances leads to a straightening law on the symmetric algebra. The main examples of such modules are the “generic” modules defined by generic and alternating matrices. The notion of an MSL was introduced by the author in [Br.3] and discussed extensively during the workshop. The main differences of this survey to [Br.3] are the more detailed study of examples and the treatment of the depth of MSLs which is almost entirely missing in [Br.3]

Recently M. M. Kapranov [Kap] defined a poset KPAn−1, called the permuto-associahedron, which is a hybrid between the face poset of the permutohedron and the associahedron. Its faces are the partially parenthesized, ordered, partitions of the set {1, 2, …, n}, with a natural partial order. Kapranov showed that KPAn−1, is the face poset of a regular CW-ball, and explored its connection with a category-theoretic result of MacLane, Drinfeld's work on the Knizhnik-Zamolodchikov equations, and a certain moduli space of curves. He also asked the question of whether this CW-ball can be realized as a convex polytope. We show that indeed, the permuto-associahedron corresponds to the type An−1, in a family of convex polytopes KPW associated to the classical Coxeter groups, W = An−1, Bn, Dn. The embedding of these polytopes relies on the secondary polytope construction of the associahedron due to Gel'fand, Kapranov, and Zelevinsky. Our proofs yield integral coordinates, with all vertices on a sphere, and include a complete description of the facet-defining inequalities. Also we show that for each W, the dual polytope KPW* is a refinement (as a CW-complex) of the Coxeter complex associated to W, and a coarsening of the barycentric subdivision of the Coxeter complex. In the case W = An−1, this gives a combinatorial proof of Kapranov's original sphericity result.

For any amalgam ( S , T ; U ) (S,\,T;\,U) of inverse semigroups, it is shown that the natural partial order on S ∗ U T S{{\ast }_U}T , the (inverse semigroup) free product of S S and T T amalgamating U U , has a simple form on S ∪ T S \cup T . In particular, it follows that the semilattice of S ∗ U T S{{\ast }_U}T is a bundled semilattice of the corresponding semilattice amalgam ( E ( S ) , E ( T ) ; E ( U ) ) (E(S),\,E(T);\,E(U)) ; taken jointly with a result of Teruo Imaoka, this gives that the class of generalized inverse semigroups has the strong amalgamation property. Preserving finiteness is also considered.

The set Λ of isols was extensively studied by Dekker and Myhill in [1]. Subsequently, Nerode [3] developed the theory of Λ(A), the set of isols relative to some recursively closed set of functions A.One of the main areas of interest of [1] was the natural partial order ≤ on Λ. In this paper we will examine some of the properties of ≤A on Λ(A). We use the following notations: ∣A∣ is the cardinality of the set A, ⊃ denotes strict inclusion, (a) is the power set of the set a, c is the cardinality of the continuum, and ω = {0, 1, 2, …}. The terms A-isol, A-immune, A-r.e., A-incomparable, etc. all refer to the usual meaning of these words, only taken in the context of the recursively closed set A. ReqA(a) is the A-r.e.t. of which a is a representative. By identifying a finite natural number with the A-r.e.t. consisting of sets of a given finite cardinality we see that ω ⊆ Λ(A); Λ(A) is said to be nontrivial iff ω ⊃ Λ(A). The three results proven in this paper are:Theorem 1. If Λ(A) is nontrivial, then ∣Λ(A)∣ = c.Theorem 2. If∣A∣ < c, then Λ(A) is nontrivial.Theorem 3. If ∣A∣ < c and ∣⊿∣ < c and ⊿ ⊆ Λ(A) − ω, then there is aΓ ⊆ Λ(A) − ω such that:(a) ∣Γ∣ = c.(b) Every member of Γ is A-incomparable with every member of Δ.(c) Any two distinct members of Γ are A-incomparable.

S-functions are mappings from the class of finite graphs into the set of integers, such that certain formal conditions are fulfilled which are shared by the chromatic number, the vertex-connectivity, and the homomorphism-degree. The S-functions form a complete lattice (with respect to their natural partial order). The classes of graphs with values <n under some S-function are studied from a general point of view, and uncountably many S-functions are constructed. Further for every n≥5 a non-trivial base-element of (see K. WAGNER [7]) is constructed.

The natural partial order on semirings

We give a thorough structural analysis of the principal one-sided ideals of arbitrary semigroups, and then apply this to full transformation semigroups and symmetric inverse monoids. One-sided ideals of these semigroups naturally occur as semigroups of transformations with restricted range or kernel.

In this paper, we investigate the left regularity, right regularity, and complete regularity of elements in subsemigroups of the semigroups of linear transformations with invariant subspaces. We provide necessary and sufficient conditions for these subsemigroups to be left regular, right regular, and completely regular. Specifically, we examine semigroups of linear transformations with restricted range, invariant subspaces, and fixed subspaces. The results offer a comprehensive characterization of regular elements within these algebraic structures and extend existing work in this field. Our findings have potential applications in algebraic theory, particularly in the study of transformation semigroups and their subsemigroups.