Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances.

DOI10.1016/J.APAL.2010.05.001zbMath1231.20058OpenAlexW2076545165MaRDI QIDQ636382

Juan-Miguel Gracia

Publication date: 26 August 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10023/3383

zbMATH Keywords

endomorphismsgraphstransformation semigroupspre-orderstolerances

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05) Combinatorics of partially ordered sets (06A07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Automorphisms and endomorphisms of algebraic structures (08A35)

Related Items (4)

Semigroup theory of symmetry ⋮ Centralizers in the full transformation semigroup. ⋮ Generating the infinite symmetric group using a closed subgroup and the least number of other elements ⋮ The Bergman-Shelah preorder on transformation semigroups

Cites Work

• Unnamed Item
• Closed subgroups of the infinite symmetric group.
• Set theory. An introduction to independence proofs
• Generating self-map monoids of infinite sets.
• The Cichoń diagram
• Generating continuous mappings with Lipschitz mappings
• Generating Countable Sets of Permutations
• RANK PROPERTIES OF ENDOMORPHISMS OF INFINITE PARTIALLY ORDERED SETS
• Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)

This page was built for publication: Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances.