SearcharxivSearch

arXiv · 1011.2585

On thin-complete ideals of subsets of groups

Abstract

Given a family $F$ of subsets of a group $G$ we describe the structure of its thin-completion $\tau^*(F)$, which is the smallest thin-complete family that contains $I$. A family $F$ of subsets of $G$ is called thin-complete if each $F$-thin subset of $G$ belongs to $F$. A subset $A$ of $G$ is called $F$-thin if for any distinct points $x,y$ of $G$ the intersection $xA\cap yA$ belongs to the family $F$. We prove that the thin-completion of an ideal in an ideal. If $G$ is a countable non-torsion group, then the thin-completion $\tau^*(F_G)$ of the ideal $F_G$ of finite subsets of $G$ is coanalytic but not Borel in the power-set $P_G$ of $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Taras Banakh, Nadya Lyaskovska. 2010-11-11. On thin-complete ideals of subsets of groups. https://arxiv.org/abs/1011.2585

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