SearcharxivSearch

arXiv · 2210.08546

Normal submonoids and congruences on a monoid

Abstract

A notion of {\em normal submonoid} of a monoid $M$ is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf{NorSub}(M)$ of normal submonoids of $M$ is a complete lattice. Joins are explicitly described, and the lattice is computed for the finite full transformation monoids $T_n$, $n\geq 1$. It is also shown that $\mathsf{NorSub}(M)$ is modular for a specific family of commutative monoids, including all Krull monoids, and that, as a join semilattice, embeds isomorphically onto a join subsemilattice of the lattice $\mathsf{Cong}(M)$ of congruences on $M$. This leads to a new strategy for computing $\mathsf{Cong}(M)$ consisting of computing $\mathsf{NorSub}(M)$, and the lattices of the so called unital congruences on the quotients of $M$ modulo its normal submonoids. This provides a new perspective on Malcev computation of the congruences on $T_n$.

Explore related subjects

Keep this discovery

BibTeXRIS

Josep Elgueta. 2022-10-16. Normal submonoids and congruences on a monoid. https://doi.org/10.1017/s1446788723000204

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR