SearcharxivSearch

arXiv · 2208.03202

The rank of the semigroup of order-, fence-, and parity-preserving partial injections on a finite set

Abstract

The monoid of all partial injections on a finite set (the symmetric inverse semigroup) is of particular interest because of the well-known Wagner-Preston Theorem. In this article, we step forward the study of a submonoid of the symmetric inverse semigroup. We explore the monoid of all order-, fence-, and parity-preserving transformations on an $n$-element chain. We also characterize the transformations in that monoid and show that it has a rank $3n-6$. In particular, we provide a generating set $A_n$ of minimal size and exhibit concrete normal forms for the transformations generated by $A_n$.

Explore related subjects

Keep this discovery

BibTeXRIS

Apatsara Sareeto, Jörg Koppitz. 2022-08-05. The rank of the semigroup of order-, fence-, and parity-preserving partial injections on a finite set. https://arxiv.org/abs/2208.03202

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