SearcharxivSearch

arXiv · math/0509090

Finitely presented wreath products and double coset decompositions

Abstract

We characterize which permutational wreath products W^(X)\rtimes G are finitely presented. This occurs if and only if G and W are finitely presented, G acts on X with finitely generated stabilizers, and with finitely many orbits on the cartesian square X^2. On the one hand, this extends a result of G. Baumslag about standard wreath products; on the other hand, this provides nontrivial examples of finitely presented groups. For instance, we obtain two quasi-isometric finitely presented groups, one of which is torsion-free and the other has an infinite torsion subgroup. Motivated by the characterization above, we discuss the following question: which finitely generated groups can have a finitely generated subgroup with finitely many double cosets? The discussion involves properties related to the structure of maximal subgroups, and to the profinite topology.

Explore related subjects

Keep this discovery

BibTeXRIS

Yves de Cornulier. 2005-09-05. Finitely presented wreath products and double coset decompositions. https://doi.org/10.1007/s10711-006-9061-4

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