endomorphism monoids
Recently Published Documents


TOTAL DOCUMENTS

49
(FIVE YEARS 3)

H-INDEX

8
(FIVE YEARS 0)

2019 ◽  
Vol 26 (03) ◽  
pp. 507-518
Author(s):  
Jie Fang ◽  
Zhongju Sun

An endomorphism monoid of an algebra [Formula: see text] is said to be a band if every endomorphism on [Formula: see text] is an idempotent, and it is said to be a demi-band if every non-injective endomorphism on [Formula: see text] is an idempotent. We precisely determine finite Kleene algebras whose endomorphism monoids are demi-bands and bands via Priestley duality.


2018 ◽  
Vol 11 (04) ◽  
pp. 1850059
Author(s):  
Somnuek Worawiset

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.


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

2016 ◽  
Vol 81 (4) ◽  
pp. 1255-1297 ◽  
Author(s):  
MANUEL BODIRSKY ◽  
PETER JONSSON ◽  
TRUNG VAN PHAM

AbstractLet ($\rm L$;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of ($\rm L$;C), i.e., the structures with domain $\rm L$ that are first-order definable in ($\rm L$;C). We show that up to existential interdefinability, there are finitely many such reducts. This implies that there are finitely many reducts up to first-order interdefinability, thus confirming a conjecture of Simon Thomas for the special case of ($\rm L$;C). We also study the endomorphism monoids of such reducts and show that they fall into four categories.


2016 ◽  
Vol 76 (2) ◽  
pp. 287-292
Author(s):  
P. Goralčík ◽  
V. Koubek ◽  
J. Sichler
Keyword(s):  

2016 ◽  
Vol 08 (02) ◽  
pp. 1650020 ◽  
Author(s):  
Xiaobin Ma ◽  
Dein Wong ◽  
Jinming Zhou

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.


2016 ◽  
Vol 93 (3) ◽  
pp. 535-553 ◽  
Author(s):  
Yang Dandan ◽  
Victoria Gould
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document