SearcharxivSearch

arXiv · 2604.02087

A family of groups extending McLain's

Abstract

Given a strict partial order $\Delta$ on a set $\Lambda$ and an arbitrary ring $R$ with $1\neq 0$, the corresponding McLain group $M(\Delta)$ has been studied in depth. We construct a larger family of McLain groups $G(\Delta)$, where $\Delta$ is neither asymmetric nor transitive, while satisfying two weaker axioms. Structural properties common to all members~$G(\Delta)$ of this new family are investigated, including a group presentation, a description of the factors of its descending central series, a canonical form for its elements relative to any total order on~$\Delta$, and a recursive determination of its upper central series. In addition, we prove the natural isomorphism $G(\Delta)/G(\Gamma)\cong G(\Delta\setminus\Gamma)$, where $\Gamma$ is a normal subset $\Gamma$ of $\Delta$, and $G(\Gamma)$ and $G(\Delta\setminus\Gamma)$ are extended McLain groups on their own right. This result has no parallel in the classical context.

Explore related subjects

Keep this discovery

BibTeXRIS

Leandro Cagliero, Fernando Szechtman. 2026-04-02. A family of groups extending McLain's. https://arxiv.org/abs/2604.02087

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