scholarly journals A topological characterisation of endomorphism monoids of countable structures

2017 ◽  
Vol 77 (3) ◽  
pp. 251-269 ◽  
Author(s):  
Manuel Bodirsky ◽  
Friedrich Martin Schneider
Keyword(s):  
Endomorphism Monoids

scholarly journals Free idempotent generated semigroups and endomorphism monoids of free G-acts

2015 ◽  
Vol 429 ◽  
pp. 133-176 ◽  
Author(s):  
Yang Dandan ◽  
Igor Dolinka ◽  
Victoria Gould
Keyword(s):  
Endomorphism Monoids

Idempotent rank in endomorphism monoids of finite independence algebras

2007 ◽  
Vol 137 (2) ◽  
pp. 303-331 ◽  
Author(s):  
R. Gray
Keyword(s):  
Proper Ideal ◽  
Endomorphism Monoid ◽  
Endomorphism Monoids ◽  
Idempotent Rank

In 1992, Fountain and Lewin showed that any proper ideal of an endomorphism monoid of a finite independence algebra is generated by idempotents. Here the ranks and idempotent ranks of these ideals are determined. In particular, it is shown that when the algebra has dimension greater than or equal to three the idempotent rank equals the rank.

On the endomorphism monoids of Clifford semigroups

2018 ◽  
Vol 11 (04) ◽  
pp. 1850059
Author(s):  
Somnuek Worawiset
Keyword(s):  
Endomorphism Monoids ◽  
Clifford Semigroups

In this paper, we study properties of the endomorphism monoids of strong semilattices of groups. In Sec. 2, several properties for endomorphism monoids of finite semilattices are investigated. In Sec. 3, we collect some results on endomorphism monoids of strong semilattices of groups, i.e. Clifford semigroups.

Hereditary endomorphism monoids of projective acts

1991 ◽  
Vol 70 (1) ◽  
pp. 133-143 ◽  
Author(s):  
Ulrich Knauer ◽  
Peeter Normak
Keyword(s):  
Endomorphism Monoids

Endomorphism monoids of free acts and O-wreath products of monoids

1980 ◽  
Vol 19 (1) ◽  
pp. 189-198 ◽  
Author(s):  
Ulrich Knauer ◽  
Alexander Mikhalev
Keyword(s):  
Wreath Products ◽  
Endomorphism Monoids

Endomorphism monoids of free acts and O-wreath products of monoids

1980 ◽  
Vol 19 (1) ◽  
pp. 355-369
Author(s):  
Ulrich Knauer ◽  
Alexander Mikhalev
Keyword(s):  
Wreath Products ◽  
Endomorphism Monoids

scholarly journals A universality result for endomorphism monoids of some ultrahomogeneous structures

2012 ◽  
Vol 55 (3) ◽  
pp. 635-656 ◽  
Author(s):  
Igor Dolinka ◽  
Dragan Mašulović
Keyword(s):  
Endomorphism Monoid ◽  
Sufficient Condition ◽  
Urysohn Space ◽  
Endomorphism Monoids ◽  
General Sufficient Condition ◽  
Countably Infinite ◽  
New Applications

AbstractWe devise a fairly general sufficient condition ensuring that the endomorphism monoid of a countably infinite ultrahomogeneous structure (i.e. a Fraïssé limit) embeds all countable semigroups. This approach not only provides us with a framework unifying the previous scattered results in this vein, but actually yields new applications for endomorphism monoids of the (rational) Urysohn space and the countable universal ultrahomogeneous semilattice.

Endomorphism monoids of free acts and O-wreath products of monoids

1980 ◽  
Vol 19 (1) ◽  
pp. 177-187 ◽  
Author(s):  
Ulrich Knauer ◽  
Alexander Mikhalev
Keyword(s):  
Wreath Products ◽  
Endomorphism Monoids

Unicyclic graphs with regular endomorphism monoids

2016 ◽  
Vol 08 (02) ◽  
pp. 1650020 ◽  
Author(s):  
Xiaobin Ma ◽  
Dein Wong ◽  
Jinming Zhou
Keyword(s):  
Unicyclic Graph ◽  
Endomorphism Monoid ◽  
Unicyclic Graphs ◽  
Endomorphism Monoids ◽  
Odd Cycle ◽  
Open Question

The motivation of this paper comes from an open question: which graphs have regular endomorphism monoids? In this paper, we give a definitely answer for unicyclic graphs, proving that a unicyclic graph [Formula: see text] is End-regular if and only if, either [Formula: see text] is an even cycle with 4, 6 or 8 vertices, or [Formula: see text] contains an odd cycle [Formula: see text] such that the distance of any vertex to [Formula: see text] is at most 1, i.e., [Formula: see text]. The join of two unicyclic graphs with a regular endomorphism monoid is explicitly described.

Sign in / Sign up

Export Citation Format

Share Document