The rank of the endomorphism monoid of a uniform partition.

DOI10.1007/S00233-008-9122-0zbMATH Open1176.20059arXiv0807.1214OpenAlexW1977841303MaRDI QIDQ2391158FDOQ2391158

Authors: João Araújo, Csaba Schneider 

Publication date: 24 July 2009

Published in: Semigroup Forum (Search for Journal in Brave)

Abstract: The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a finite set that leave a non-trivial uniform partition invariant. That involves proving that the rank of a wreath product of two symmetric groups is two and then use the fact that the endomorphism monoid of a partition is isomorphic to a wreath product of two full transformation semigroups. The calculation of the rank of these semigroups solves an open question.

Full work available at URL: https://arxiv.org/abs/0807.1214

Recommendations

• Idempotent rank in the endomorphism monoid of a nonuniform partition.
• Idempotent generation in the endomorphism monoid of a uniform partition
• On the ranks of certain monoids of transformations that preserve a uniform partition.
• Partial transformation monoids preserving a uniform partition.
• Relative ranks in the monoid of endomorphisms of an independence algebra.

zbMATH Keywords

generating setswreath productstransformation semigroupsendomorphism monoidsrelative ranksuniform partitions

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05)

Cites Work

• The Magma algebra system. I: The user language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the ranks of certain semigroups of order-preserving transformations
• On the nilpotent ranks of certain semigroups of transformations
• Ranks of Semigroups Generated by Order-Preserving Transformations with a Fixed Partition Type
• RANK PROPERTIES OF ENDOMORPHISMS OF INFINITE PARTIALLY ORDERED SETS
• Idempotent rank in finite full transformation semigroups
• On relative ranks of full transformation semigroups
• COMBINATORIAL TECHNIQUES FOR DETERMINING RANK AND IDEMPOTENT RANK OF CERTAIN FINITE SEMIGROUPS
• On idempotent ranks of semigroups of partial transformations.
• Generating continuous mappings with Lipschitz mappings
• COUNTABLE VERSUS UNCOUNTABLE RANKS IN INFINITE SEMIGROUPS OF TRANSFORMATIONS AND RELATIONS
• Relative ranks in the monoid of endomorphisms of an independence algebra.
• Generators and factorisations of transformation semigroups
• On the rank of the semigroup \(T_E(X)\)
• On generating countable sets of endomorphisms
• Nilpotent ranks of semigroups of partial transformations.
• Rank properties in finite inverse semigroups

Cited In (24)

• Presentations for singular wreath products
• On certain semigroups of transformations that preserve a partition
• On Finite Monoids of Cellular Automata
• Idempotent rank in the endomorphism monoid of a nonuniform partition.
• On the minimal number of generators of endomorphism monoids of full shifts
• Bounding the minimal number of generators of groups and monoids of cellular automata
• Cellular automata and finite groups
• Graphs and ranks of monoids
• Ranks of monoids of endomorphisms of a finite undirected path
• Partial transformation monoids preserving a uniform partition.
• Regular and unit-regular elements in various monoids of transformations
• On the ranks of certain monoids of transformations that preserve a uniform partition.
• Ranks of finite semigroups of one-dimensional cellular automata
• The rank of the semigroup of transformations stabilising a partition of a finite set
• The minimal number of generators of a finite semigroup.
• Variants of epigroups and primary conjugacy
• A partial order on transformation semigroups that preserve double direction equivalence relation.
• The relative rank of the endomorphism monoid of a finite \(G\)-set
• Regular, unit-regular, and idempotent elements of semigroups of transformations that preserve a partition
• On the semigroup of partition-preserving transformations whose characters are bijective
• On the monoids of transformations that preserve the order and a uniform partition.
• Elementary, finite and linear vN-regular cellular automata
• Generating wreath products of symmetric and alternating groups
• Idempotent generation in the endomorphism monoid of a uniform partition

Uses Software

• GAP
• Magma

This page was built for publication: The rank of the endomorphism monoid of a uniform partition.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391158)