Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.18784

Completely Syndetic Sets in Discrete Groups

Guy Salomon·Yotam Svoray·Ariel Yadin
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually nilpotent ones admit a partition into two CS sets, we show that virtually abelian groups do not. We also characterize CS subsets of the group of integers Z, and as a result characterize subsets of Z whose closure in the Stone-Cech compactification contains the smallest two sided ideal. Finally, we show that CS sets can have an arbitrarily small density.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Guy Salomon, Yotam Svoray, Ariel Yadin. 2025-06-23. Completely Syndetic Sets in Discrete Groups. https://arxiv.org/abs/2506.18784

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↗