Search arXivSearch

arXiv · math/0703478

On a new approach to the dual symmetric inverse monoid $I*_X$

Abstract

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 faithful effective transitive representation of $\mathcal{IP}_n$, namely to $\mathcal{IS}_{2^n-2}$. Finally, we construct an interesting $\mathcal{H}$-cross-section of $\mathcal{IP}_n$, which is reminiscent of $\mathcal{IO}_n$, the $\mathcal{H}$-cross-section of $\mathcal{IS}_n$, constructed in [4].

Explore related subjects

Keep this discovery

BibTeXRIS

Victor Maltcev. 2007-03-16. On a new approach to the dual symmetric inverse monoid $I*_X$. https://arxiv.org/abs/math/0703478

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