The endomorphism monoid of the random poset contains all countable semigroups
From MaRDI portal
Publication:997129
DOI10.1007/S00012-007-2017-1zbMATH Open1141.08001OpenAlexW2148726065MaRDI QIDQ997129FDOQ997129
Authors: Igor Dolinka
Publication date: 20 July 2007
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-007-2017-1
Recommendations
- All countable monoids embed into the monoid of the infinite random graph
- The endomorphism monoid of the random graph has uncountably many ideals.
- scientific article; zbMATH DE number 1376172
- On the endomorphism monoid of a profinite semigroup
- A topological characterisation of endomorphism monoids of countable structures
- Finite Semilattices Whose Monoids of Endomorphisms are Regular
- On generating countable sets of endomorphisms
- scientific article; zbMATH DE number 859939
- On the endomorphism semigroup of an ordered set
- A note on generators of the endomorphism semigroup of an infinite countable chain
Partial orders, general (06A06) Model-theoretic algebra (03C60) Automorphisms and endomorphisms of algebraic structures (08A35) Semigroups of transformations, relations, partitions, etc. (20M20)
Cited In (7)
- The poset of all copies of the random graph has the 2-localization property
- A universality result for endomorphism monoids of some ultrahomogeneous structures
- On generating countable sets of endomorphisms
- Title not available (Why is that?)
- All countable monoids embed into the monoid of the infinite random graph
- Remarks on homomorphism-homogeneous lattices and semilattices
- Katětov functors
This page was built for publication: The endomorphism monoid of the random poset contains all countable semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997129)