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.
Necessary and sufficient conditions are given for the endomorphism monoid of a profinite semigroup to be profinite. A similar result is established for the automorphism group.
Rodaro and Silva proved that the fixed points submonoid and the periodic points submonoid of a trace monoid endomorphism are always finitely generated. We show that for finitely generated left preGarside monoids, that includs finitely generated preGarside monoids, Garside monoids and Artin monoids, the fixed and periodic points submonoids of any endomorphism are also finitely generated left preGarside monoids under some condition, and in the case of Artin monoids, these submonoids are always Artin monoids too. We also prove algebraically some inequalities, equivalences and non-equivalences bet…
We investigate the endomorphism monoids of certain finite $p$-groups of order $p^8$ first studied by Jonah and Konvisser in 1975 as examples for finite $p$-groups with abelian automorphism group, and we show some necessary conditions for a finite $p$-group to have commutative endomorphism monoid. As a by-product, apart from formulas for the number of conjugacy classes of endomorphisms of said groups, we will be able to derive the following: There exist nonabelian groups with commutative endomorphism monoid, and having commutative endomorphism monoid is a group property strictly stronger than h…
It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. Considering the Foata normal form metric on trace monoids and uniformly continuous endomorphisms, a finiteness theorem is proved for the infinite fixed points of the continuous extension to real traces.
It is proved that the periodic point submonoid of a free inverse monoid endomorphism is always finitely generated. Using Chomsky's hierarchy of languages, we prove that the fixed point submonoid of an endomorphism of a free inverse monoid can be represented by a context-sensitive language but, in general, it cannot be represented by a context-free language.
We 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 provides us not only 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.
On the semigroup of injective monoid endomorphisms of the monoid $\boldsymbol{B}_ω^{\mathscr{F}^3}$ with a three element family $\mathscr{F}^3$ of inductive nonempty subsets of $ω$
Based on an idea of Y. Péresse and some results of Maltcev, Mitchell and Ruškuc, we present sufficient conditions under which the endomorphism monoid of a countably infinite ultrahomogeneous first-order structure has the Bergman property. This property has played a prominent role both in the theory of infinite permutation groups and, more recently, in semigroup theory. As a byproduct of our considerations, we establish a criterion for a countably infinite ultrahomogeneous structure to be homomorphism-homogeneous.
We calculate the rank and idempotent rank of the semigroup $E(X,P)$ generated by the idempotents of the semigroup $T(X,P)$, which consists of all transformations of the finite set $X$ preserving a non-uniform partition $P$. We also classify and enumerate the idempotent generating sets of this minimal possible size. This extends results of the first two authors in the uniform case.
For a group $G$ acting on a set $X$, let $\text{End}_G(X)$ be the monoid of all $G$-equivariant transformations, or $G$-endomorphisms, of $X$, and let $\text{Aut}_G(X)$ be its group of units. After discussing few basic results in a general setting, we focus on the case when $G$ and $X$ are both finite in order to determine the smallest cardinality of a set $W \subseteq \text{End}_G(X)$ such that $W \cup \text{Aut}_G(X)$ generates $\text{End}_G(X)$; this is known in semigroup theory as the relative rank of $\text{End}_G(X)$ modulo $\text{Aut}_G(X)$.
An algebra $\A$ is said to be an independence algebra if it is a matroid algebra and every map $\al:X\to A$, defined on a basis $X$ of $\A$, can be extended to an endomorphism of $\A$. These algebras are particularly well behaved generalizations of vector spaces, and hence they naturally appear in several branches of mathematics such as model theory, group theory, and semigroup theory. It is well known that matroid algebras have a well defined notion of dimension. Let $\A$ be any independence algebra of finite dimension $n$, with at least two elements. Denote by $\End(\A)$ the monoid of endomo…
On the semigroup of monoid endomorphisms of the semigroup $\boldsymbol{B}_ω^{\mathscr{F}}$ with a two-element family $\mathscr{F}$ of inductive nonempty subsets of $ω$
On injective endomorphisms of the semigroup $\boldsymbol{B}_ω^{\mathscr{F}^4}$ with a four-element family $\mathscr{F}^4$ of inductive non-empty subsets of $ω$
Ivan Franko National University of Lviv（伊万·弗兰科利沃夫国立大学）
For a group $G$ and a finite set $A$, denote by $\text{End}(A^G)$ the monoid of all continuous shift commuting self-maps of $A^G$ and by $\text{Aut}(A^G)$ its group of units. We study the minimal cardinality of a generating set, known as the rank, of $\text{End}(A^G)$ and $\text{Aut}(A^G)$. In the first part, when $G$ is a finite group, we give upper and lower bounds for the rank of $\text{Aut}(A^G)$ in terms of the number of conjugacy classes of subgroups of $G$. In the second part, we apply our bounds to show that if $G$ has an infinite descending chain of normal subgroups of finite index, t…
Let $G$ be a countable monoid and let $A$ be an Artinian group (resp. an Artinian module). Let $Σ\subset A^G$ be a closed subshift which is also a subgroup (resp. a submodule) of $A^G$. Suppose that $Γ$ is a finitely generated monoid consisting of pairwise commuting cellular automata $Σ\to Σ$ that are also homomorphisms of groups (resp. homomorphisms of modules) with monoid binary operation given by composition of maps. We show that the valuation action of $Γ$ on $Σ$ satisfies a natural intrinsic shadowing property. Generalizations are also established for families of endomorphisms of admissib…
We give a complete description of the congruences on the partition monoid $P_X$ and the partial Brauer monoid $PB_X$, where $X$ is an arbitrary infinite set, and also of the lattices formed by all such congruences. Our results complement those from a recent article of East, Mitchell, Ruskuc and Torpey, which deals with the finite case. As a consequence of our classification result, we show that the congruence lattices of $P_X$ and $PB_X$ are isomorphic to each other, and are distributive and well quasi-ordered. We also calculate the smallest number of pairs of partitions required to generate a…
We obtain several presentations by generators and relations for the rook partition monoids and algebras, as well as their singular ideals. Among other results, we also calculate the minimal sizes of generating sets (some of our presentations use such minimal-size generating sets), and show that the singular part of the rook partition monoid is generated by its idempotents.
The study of the free idempotent generated semigroup $\mathrm{IG}(E)$ over a biordered set $E$ began with the seminal work of Nambooripad in the 1970s and has seen a recent revival with a number of new approaches, both geometric and combinatorial. Here we study $\mathrm{IG}(E)$ in the case $E$ is the biordered set of a wreath product $G\wr \mathcal{T}_n$, where $G$ is a group and $\mathcal{T}_n$ is the full transformation monoid on $n$ elements. This wreath product is isomorphic to the endomorphism monoid of the free $G$-act $F_n(G)$ on $n$ generators, and this provides us with a convenient ap…
Denote by $\mathcal T_n$ and $\mathcal S_n$ the full transformation semigroup and the symmetric group on the set $\{1,\ldots,n\}$, and $\mathcal E_n=\{1\}\cup(\mathcal T_n\setminus \mathcal S_n)$. Let $\mathcal T(X,\mathcal P)$ denote the set of all transformations of the finite set $X$ preserving a uniform partition $\mathcal P$ of $X$ into $m$ subsets of size $n$, where $m,n\geq2$. We enumerate the idempotents of $\mathcal T(X,\mathcal P)$, and describe the subsemigroup $S=\langle E\rangle$ generated by the idempotents $E=E(\mathcal T(X,\mathcal P))$. We show that $S=S_1\cup S_2$, where $S_1…
On the semigroup of injective monoid endomor\-phisms of the monoid $\boldsymbol{B}_ω^{\mathscr{F}}$ with the two-elements family $\mathscr{F}$ of inductive nonempty subsets of $ω$
We give new, short proofs of the presentations for the partition monoid and its singular ideal originally given in the author's 2011 papers in J Alg and IJAC.
The objective of this paper is to study the monoid of all partial transformations of a finite set that preserve a uniform partition. In addition to proving that this monoid is a quotient of a wreath product with respect to a congruence relation, we show that it is generated by 5 generators, we compute its order and determine a presentation on a minimal generating set.
We give a complete description of the congruence lattices of the following finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also known as the Temperley-Lieb monoid), the Motzkin monoid, and the partial Brauer monoid. All the congruences under discussion arise as special instances of a new construction, involving an ideal I, a retraction I->M onto the minimal ideal, a congruence on M, and a normal subgroup of a maximal subgroup outside I.
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids indicate that they should give origin to new knot algebras; indeed, our tied monoids include the tied braid monoid and the tied singular braid monoid, which were used, respectively, to construct new polynomial invariants for classical links and singular links. Consequently, we provide a mechanism to attach an algebra to each tied monoid. To build the tied monoi…
For a monoid $M$ and a subsemigroup $S$ of the full transformation semigroup $T_n$, the wreath product $M\wr S$ is defined to be the semidirect product $M^n\rtimes S$, with the coordinatewise action of $S$ on $M^n$. The full wreath product $M\wr T_n$ is isomorphic to the endomorphism monoid of the free $M$-act on $n$ generators. Here, we are particularly interested in the case that $S=Sing_n$ is the singular part of $T_n$, consisting of all non-invertible transformations. Our main results are presentations for $M\wr Sing_n$ in terms of certain natural generating sets, and we prove these via ge…
Maximal subgroups of free projection- and idempotent-generated semigroups with applications to partition monoids
Centre for Research in Mathematics and Data Science, Western Sydney University（西悉尼大学数学与数据科学研究中心）；School of Engineering, Mathematics and Physics, University of East Anglia（东英吉利大学工程、数学与物理学院）；Mathematical Institute, School of Mathematics and Statistics, University of St Andrews（圣安德鲁斯大学数学与统计学院数学研究所）
We introduce the {\it growth partition function} $Z_{Γ,G}(t)$ associate with any cancellative infinite monoid $Γ$ with a finite generator system $G$. It is a power series in $t$ whose coefficients lie in integral Lie-like space $\mathcal{L}_{\Z}(Γ,G)$ in the configuration algebra associated with the Cayley graph $(Γ,G)$. We determine them for homogeneous monoids admitting left greatest common divisor and right common multiple. Then, for braid monoids and Artin monoids of finite type, using that formula, we explicitly determine their limit partition functions $ω_{Γ,G}$.
Let $\mathcal P_X$ and $\mathcal S_X$ be the partition monoid and symmetric group on an infinite set $X$. We show that $\mathcal P_X$ may be generated by $\mathcal S_X$ together with two (but no fewer) additional partitions, and we classify the pairs $α,β\in\mathcal P_X$ for which $\mathcal P_X$ is generated by $\mathcal S_X\cup\{α,β\}$. We also show that $\mathcal P_X$ may be generated by the set $\mathcal E_X$ of all idempotent partitions together with two (but no fewer) additional partitions. In fact, $\mathcal P_X$ is generated by $\mathcal E_X\cup\{α,β\}$ if and only if it is generated by…
For a positive integer $d$, a non-negative integer $n$ and a non-negative integer $h\leq n$, we study the number $C_{n}^{(d)}$ of principal ideals; and the number $C_{n,h}^{(d)}$ of principal ideals generated by an element of rank $h$, in the $d$-tonal partition monoid on $n$ elements. We compute closed forms for the first family, as partial cumulative sums of known sequences. The second gives an infinite family of new integral sequences. We discuss their connections to certain integral lattices as well as to combinatorics of partitions.
On injective endomorphisms of the semigroup $\boldsymbol{B}_ω^{\mathscr{F}^3}$ with a three-element family $\mathscr{F}^3$ of inductive non-empty subsets of $ω$
We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $Ω$, there are uncountably many maximal subgroups of $\operatorname{End}(\mathbb{Q},{\leq})$ isomorphic to the automorphism group of $Ω$. We characterise those subsets $X$ of $\mathbb{Q}$ that arise as a retract in $(\mathbb{Q},{\leq})$ in terms of topological information concerning $X$. Finally, we establish that a countable group arises as the automorphism group of a countable linearly ordered set, and hence as a maximal…
We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving transformations and partial permutations considered by V. H. Fernandes and co-authors (12 monoids in total); the partition, Brauer, Jones, and Motzkin monoids; and certain further monoids. Although descriptions of the maximal subsemigroups of some of the aforementioned classes of monoids appear in the literature, we present a unified framework for determining…
On the semigroup of endomorphisms of the semigroup $\boldsymbol{B}_ω^{\mathscr{F}^2}$ with the two-element family $\mathscr{F}^2$ of inductive nonempty subsets of $ω$
On the semigroup of injective endomorphisms of the semigroup $\boldsymbol{B}_ω^{\mathscr{F}_n}$ which is generated by the family $\mathscr{F}_n$ of initial finite intervals of $ω$
We construct the \emph{inverse partition semigroup} $\mathcal{IP}_X$, isomorphic to the \emph{dual symmetric inverse monoid} $\mathcal{I}^{\ast}_X$, introduced in [6]. We give a convenient geometric illustration for elements of $\mathcal{IP}_X$. We describe all maximal subsemigroups of $\mathcal{IP}_X$ and find a generating set for $\mathcal{IP}_X$ when $X$ is finite. We prove that all the automorphisms of $\mathcal{IP}_X$ are inner. We show how to embed the symmetric inverse semigroup into the inverse partition one. For finite sets $X$, we establish that, up to equivalence, there is a unique …
We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of idempotents in each monoid as well as various $\mathscr R$-, $\mathscr L$- and $\mathscr D$-classes. We also apply our results to determine the number of idempotent basis elements in the finite dimensional partition, Brauer and partial Brauer algebras.
Let $K$ be a field of characteristic two, and let $λ$ be a two-part partition of some natural number $r$. Denote the permutation module corresponding to the (maximal) Young subgroup $Σ_λ$ in $Σ_r$ by $M^λ$. We construct a full set of orthogonal primitive idempotents of the centraliser subalgebra $S_K(λ) = 1_λS_K(2,r) 1_λ= End_{KΣ_r}(M^λ)$ of the Schur algebra $S_K(2,r)$. These idempotents are naturally in one-to-one correspondence with the 2-Kostka numbers.
We introduce two spaces $Ω(Γ,G)$ and $Ω(P_{Γ,G})$ of pre-partition functions and of opposite series, respectively, which are associated with a Cayley graph $(Γ,G)$ of a cancellative monoid $Γ$ with a finite generating system $G$ and with its growth function $P_{Γ,G}(t)$. Under mild assumptions on $(Γ,G)$, we introduce a fibration $π_Ω:Ω(Γ,G)\to Ω(P_{Γ,G})$ equivariant with a $\Z_{\ge0}$-action, which is transitive if it is of finite order. Then, the sum of pre-partition functions in a fiber is a linear combination of residues of the proportion of two growth functions $P_{Γ,G}(t)$ and $P_{Γ,G}\…
Let n be a positive integer and let p be a prime. Suppose that we take a partition of n, and obtain another partition by moving a node from one row to a shorther row. Carter and Payne showed that if the p-residue of the removed and added positions is the same, then there is a non-zero homomorphism between the corresponding Specht modules for the symmetric group of degree n, defined over a field of characteristic p. In this paper we give a very simple description of such a homomorphism, as a map between polytabloids, using the action of a Murphy-Jucys element. We also present a proof that in th…
