Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.05742

$E\mathcal{Z}$-boundaries, splittings over finite subgroups, and dense amalgams

Mateusz Kandybo·Jacek Świątkowski
View original source ↗Read source document ↗Export metadata ↓

Abstract

The dense amalgam is an operation (introduced in arXiv:1410.4989) which to any finite collection of metrizable compacta associates canonically some new highly disconnected compact metrisable space in which embedded copies of the initial spaces are appropriately uniformly and disjointly distributed. We show that in the very general framework of $E\mathcal{Z}$-boundaries (unifying many frameworks such as Gromov boundaries, CAT(0)-boundaries, systolic boundaries, etc.), any boundary $Z$ of an infinitely ended group $\Gamma$ equipped with an appropriate splitting along finite subgroups has a form of the dense amalgam of the limit sets in $Z$ of the factor subgroups of this splitting.

Explore related subjects

math.GRmath.GT

Keep this discovery

BibTeXRIS

Mateusz Kandybo, Jacek Świątkowski. 2026-03-05. $E\mathcal{Z}$-boundaries, splittings over finite subgroups, and dense amalgams. https://arxiv.org/abs/2603.05742

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗