SearcharxivSearch

arXiv · 1211.6395

Shift-minimal groups, fixed price 1, and the unique trace property

Abstract

A countable group Γis called shift-minimal if every non-trivial measure preserving action of Γweakly contained in the Bernoulli shift of Γon ([0,1]^Γ,λ^Γ) is free. We show that any group Γwhose reduced C^*-algebra admits a unique tracial state is shift-minimal, and that any group Γadmitting a free measure preserving action of cost>1 contains a finite normal subgroup N such that Γ/N is shift-minimal. Any shift-minimal group in turn is shown to have trivial amenable radical. Recurrence arguments are used in studying invariant random subgroups of a wide variety of shift-minimal groups. We also examine continuity properties of cost in the context of infinitely generated groups and equivalence relations. A number of open questions are discussed which concern cost, shift-minimality, C^*-simplicity, and uniqueness of tracial state on C^*_r(Γ).

Explore related subjects

Keep this discovery

BibTeXRIS

Robin D. Tucker-Drob. 2012-12-21. Shift-minimal groups, fixed price 1, and the unique trace property. https://arxiv.org/abs/1211.6395

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