SearcharxivSearch

arXiv · 1407.5697

A product for permutation groups and topological groups

Abstract

We introduce a new product for permutation groups. It takes as input two permutation groups, M and N, and produces an infinite group M [X] N which carries many of the permutational properties of M. Under mild conditions on M and N the group M [X] N is simple. As a permutational product, its most significant property is the following: M [X] N is primitive if and only if M is primitive but not regular, and N is transitive. Despite this remarkable similarity with the wreath product in product action, M [X] N and M Wr N are thoroughly dissimilar. The product provides a general way to build exotic examples of non-discrete, simple, totally disconnected, locally compact, compactly generated topological groups from discrete groups. We use this to solve a well-known open problem from topological group theory, by obtaining the first construction of uncountably many pairwise non-isomorphic simple topological groups that are totally disconnected, locally compact, compactly generated and non-discrete. The groups we construct all contain the same compact open subgroup. To build the product, we describe a group U(M,N) that acts on an edge-transitive biregular tree T. This group has a natural universal property and is analogous to the iconic universal group construction of M. Burger and S. Mozes for locally finite regular trees.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon M. Smith. 2014-07-22. A product for permutation groups and topological groups. https://doi.org/10.1215/00127094-2017-0022

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