SearcharxivSearch

arXiv · 1802.01904

On the width of transitive sets: bounds on matrix coefficients of finite groups

Abstract

We say that a finite subset of the unit sphere in $\mathbf{R}^d$ is transitive if there is a group of isometries which acts transitively on it. We show that the width of any transitive set is bounded above by a constant times $(\log d)^{-1/2}$. This is a consequence of the following result: If $G$ is a finite group and $\rho : G \rightarrow \mbox{U}_d(\mathbf{C})$ a unitary representation, and if $v \in \mathbf{C}^d$ is a unit vector, there is another unit vector $w \in \mathbf{C}^d$ such that \[ \sup_{g \in G} |\langle \rho(g) v, w \rangle| \leq (1 + c \log d)^{-1/2}.\] These results answer a question of Yufei Zhao. An immediate consequence of our result is that the diameter of any quotient $S(\mathbf{R}^d)/G$ of the unit sphere by a finite group $G$ of isometries is at least $\pi/2 - o_{d \rightarrow \infty}(1)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ben Green. 2018-02-06. On the width of transitive sets: bounds on matrix coefficients of finite groups. https://doi.org/10.1215/00127094-2019-0074

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