SearcharxivSearch

arXiv · 2510.18051

A unit theorem for products of groups with several ends and Applications

Abstract

In his $1994$ survey, Kleinert defined formally and formulated the problem to obtain unit theorems for unit groups of orders in a semisimple algebra $A$. If $A$ is a group algebra $FG$, it boils down to classifying all finite groups $G$ such that the unit groups of most orders in $FG$ belong to a prescribed class $\mathcal{G}$ of infinite groups. We solve this problem for $\mathcal{G}$ consisting of the groups which are virtually a direct product of groups whose Cayley graph has more than one end. Subsequently, we obtain two types of applications. A first type being about the existence of torsion-free normal complements and a second about obtaining short and uniform proofs of some of the main results in [13,18,14,15].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Geoffrey Janssens. 2025-10-20. A unit theorem for products of groups with several ends and Applications. https://arxiv.org/abs/2510.18051

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