SearcharxivSearch

arXiv · 2509.08325

Products of Infinite Countable Groups Have Fixed Price One

Abstract

We prove that the product of any two infinite countable groups has fixed price one. This resolves a longstanding problem posed by Gaboriau. The proof uses the propagation method to construct a Poisson horoball process as a weak limit of a sequence of factors of iid. We then construct a low-cost graphing by showing that the resulting horoballs have a variant of the infinite touching property almost surely, if the metric and the other parameters of the construction are chosen carefully. A novelty is providing direct simple proofs that do not rely on sophisticated results like amenability and double-recurrence, which are used in related works. An essential tool for avoiding any growth conditions is the convergence in the sense of point processes of pointed closed subsets, which is a notion from stochastic geometry. Also, to manage the overlapping of the horoballs, a generalization of the induction lemma is presented for random multisets of a group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Khezeli. 2025-09-10. Products of Infinite Countable Groups Have Fixed Price One. https://arxiv.org/abs/2509.08325

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