Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.13235

Isoperimetric profiles of lamplighter-like groups

Corentin Correia·Vincent Dumoncel
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a finitely generated amenable group $H$ satisfying some mild assumptions, we relate isoperimetric profiles of the lampshuffler group $\mathsf{Shuffler}(H)=\mathsf{FSym}(H)\rtimes H$ to those of $H$. Our results are sharp for all exponential growth groups for which isoperimetric profiles are known, including Brieussel-Zheng groups. This refines previous estimates obtained by Erschler and Zheng and by Saloff-Coste and Zheng. The most difficult part is to find an optimal upper bound, and our strategy consists in finding suitable lamplighter subgraphs in lampshufflers. This novelty applies more generally for many examples of halo products, a class of groups introduced recently by Genevois and Tessera as a natural generalisation of wreath products. Lastly, we also give applications of our estimates on isoperimetric profiles to the existence problem of regular maps between such groups.

Explore related subjects

math.GRmath.GTmath.MG

Keep this discovery

BibTeXRIS

Corentin Correia, Vincent Dumoncel. 2025-06-16. Isoperimetric profiles of lamplighter-like groups. https://arxiv.org/abs/2506.13235

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↗