Hereditary endomorphism monoids of projective acts

Projective acts whose endomorphism monoids are left or right (semi-) hereditary are characterized. For example, it is shown that for a noncyclic free or projective S-act P, End P is left (semi) hereditary if and only if P ≈ Se₁ Π Se₂ and e₁Se₁, e₂Se₂ are groups.     

Bipartite graphs and their endomorphism monoids

It is shown that any connected bipartite graph is determined by its endomorphism monoid up to isomorphism. © 1996 John Wiley & Sons, Inc.     

Graphs whose endomorphism monoids are regular

In this paper, we give several approaches to construct new End-regular (-orthodox) graphs by means of the join and the lexicographic product of two graphs with certain conditions. In particular, the join of two connected bipartite graphs with a regular (orthodox) endomorphism monoid is explicitly described.     

On endomorphism monoids in varieties of bands

It will be proved that every non-trivial variety \({\mathbb{V}}\) of bands (idempotent semigroups) contains a proper generating class of non-isomorphic bands B such that B generates \({\mathbb{V}}\) and any band \({B\prime}\) having the same endomorphism monoid as B is isomorphic to B or to the opposite band B^op. Consequently, every sharply greater band variety has a sharply greater class of endomorphism monoids.     

Graphs whose strong endomorphism monoids are regular

Let X be a graph, S End X be its strong endomorphism monoid. It is proved that S End X is a regular monoid if and only if the canonical strong factor graph U of X contains no proper subgraph which is isomorphic to U. The result generalizes that of U. Knauer about the regularity of strong endomorphism monoids of graphs.     

广义字典序积的自同态幺半群

讨论了图的广义字典序积的自同态幺半群的性质,给出了广义字典序积图X[Yz|x∈V（X）]的自同态幺半群与X,Yx(x∈V(X))的自同态幺半群的圈积相等的充要条件。     

On the endomorphism monoids of (uniquely) complemented lattices

Let be a lattice with and . An endomorphism of is a -endomorphism, if it satisfies and . The -endomorphisms of form a monoid. In 1970, the authors proved that every monoid can be represented as the -endomorphism monoid of a suitable lattice with and . In this paper, we prove the stronger result that the lattice with a given -endomorphism monoid can be constructed as a uniquely complemented lattice; moreover, if is finite, then can be chosen as a finite complemented lattice.

     

The endomorphism monoids and automorphism groups of Cayley graphs of semigroups

In this note, we introduce the notions of color-permutable automorphisms and color-permutable vertex-transitive Cayley graphs of semigroups. As a main result, for a finite monoid S and a generating set C of S, we explicitly determine the color-permutable automorphism group of \(\mathrm {Cay}(S,C)\) [Theorem 1.1]. Also for a monoid S and a generating set C of S, we explicitly determine the color-preserving automorphism group (endomorphism monoid) of \(\mathrm {Cay}(S,C)\) [Proposition 2.3 and Corollary 2.4]. Then we use these results to characterize when \(\mathrm {Cay}(S,C)\) is color-endomorphism vertex-transitive [Theorem 3.4].     

A method of finding automorphism groups of endomorphism monoids of relational systems

For any set X and any relation ρ on X, let T(X,ρ) be the semigroup of all maps a:X→X that preserve ρ. Let S(X) be the symmetric group on X. If ρ is reflexive, the group of automorphisms of T(X,ρ) is isomorphic to N_S(X)(T(X,ρ)), the normalizer of T(X,ρ) in S(X), that is, the group of permutations on X that preserve T(X,ρ) under conjugation. The elements of N_S(X)(T(X,ρ)) have been described for the class of so-called dense relations ρ. The paper is dedicated to applications of this result.     

Freeoids: a semi-abstract view on endomorphism monoids of relatively free algebras

A freeoid over a (normally, infinite) set of variables X is defined to be a pair (W, E), where W is a superset of X, and E is a submonoid of W ^W containing just one extension of every mapping X → W. For instance, if W is a relatively free algebra over a set of free generators X, then the pair F(W) := (W, End(W)) is a freeoid. In the paper, the kernel equivalence and the range of the transformation F are characterized. Freeoids form a category; it is shown that the transformation F gives rise to a functor from the category of relatively free algebras to the category of freeoids which yields a concrete equivalence of the first category to a full subcategory of the second one. Also, the concept of a model of a freeoid is introduced; the variety generated by a free algebra W is shown to be concretely equivalent to the category of models of F(W). The sets X, W, and the algebras W may generally be many-sorted.     

Periodic groups whose simple modules have finite central endomorphism dimension

Theorem. If is an uncountable field and is a periodic group with no elements of order the characteristic of and if all simple modules have finite central endomorphism dimension, then has an abelian subgroup of finite index.

     

Endomorphism monoids of acts over monoids

In this paper we investigate under which conditions a monoid R is defined by the endomorphism monoid of an act over R. More precisely, we ask when an isomorphism between two such endomorphism monoids over monoids R₁ and R₂ is induced by a semilinear isomorphism. The question is considered also for ordered and for topological monoids. On the way we characterize monoids over which all projective acts are free. An abstract of this paper appeared in the Proceedings of the Conference on Semigroups, Szeged 1972.     

Chains of subsemigroups

We show that if \(\mathcal{L}\) is a line in the plane containing a badly approximable vector, then almost every point in \(\mathcal{L}\) does not admit an improvement in Dirichlet’s theorem. Our proof relies on a measure classification result for certain measures invariant under a nonabelian two-dimensional group on the homogeneous space SL₃(?)/SL₃(?). Using the measure classification theorem, we reprove a result of Shah about planar nondegenerate curves (which are not necessarily analytic), and prove analogous results for the framework of Diophantine approximation with weights. We also show that there are line segments in ?³ which do contain badly approximable points, and for which all points do admit an improvement in Dirichlet’s theorem.