SearcharxivSearch

arXiv · 2412.19485

Nilpotent groups, solvable groups and factorizable inverse monoids

Abstract

In this paper subcentral (resp., central) idempotent series and composition subcentral (resp., central) idempotent series in an inverse semigroup are introduced and investigated. It is shown that if $S=EG$ is a factorizable inverse monoids with semilattice $E$ of idempotents and the group $G$ of units such that the natural connection $\theta$ is a dual isomorphism from $E$ to a sublattice of $L(G)$, then any two composition subcentral (resp., central) idempotent series in $S$ are isomorphic. It may be considered as an appropriate analogue in semigroup theory of Jordan-H\"{o}lder Theorem in group theory. Based on this,$G$-nilpotent and $G$-solvable inverse monoids are also introduced and studies. Some characterizations of the coset monoid of nilpotent groups and solvable groups are given. This extends the main result in Semigroup Forum 20: 255-267, 1980 and also provides another effective approach for the study of nilpotent and solvable groups. Finally, some open problems related to nilpotent and solvable groups are translated to semigroup theory, which may be helpful for us to solve these open problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dong-lin Lei, Jin-xing Zhao, Xian-zhong Zhao. 2024-12-27. Nilpotent groups, solvable groups and factorizable inverse monoids. https://arxiv.org/abs/2412.19485

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