SearcharxivSearch

arXiv · 2312.09954

Intersection-saturated groups without free subgroups

Abstract

A group $G$ is said to be intersection-saturated if for every strictly positive integer $n$ and every map $c\colon \mathcal{P}(\{1,\dots, n\})\setminus \emptyset \rightarrow \{0,1\}$, one can find subgroups $H_1,\dots, H_n\leq G$ such that for every non-empty subset $I\subseteq \{1,\dots, n\}$, the intersection $\bigcap_{i\in I}H_i$ is finitely generated if and only if $c(I)=0$. We obtain a new criterion for a group to be intersection-saturated based on the existence of arbitrarily high direct powers of a subgroup admitting an automorphism with a non-finitely generated set of fixed points. We use this criterion to find new examples of intersection-saturated groups, including Thompson's groups and the Grigorchuk group. In particular, this proves the existence of finitely presented intersection-saturated groups without non-abelian free subgroups, thus answering a question of Delgado, Roy and Ventura.

Explore related subjects

Keep this discovery

BibTeXRIS

Dominik Francoeur. 2023-12-15. Intersection-saturated groups without free subgroups. https://arxiv.org/abs/2312.09954

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