SearcharxivSearch

arXiv · 0809.1560

Cayley Graph Expanders and Groups of Finite Width

Abstract

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is given as Cayley graphs of finite groups with very short presentations with only 2 generators and 4 relations. Both families are based on particular finite quotients of a group G of infinite upper triangular matrices over the ring M(3,F2). We present explicit vector space bases for the finite abelian quotients of the lower exponent-2 groups of G by upper triangular subgroups and prove a particular 3-periodicity of these quotients. The pro-2 completion of the group G satisfies the Golod-Shafarevich inequality $|R| \geq (|X|^2)/4$, it is infinite, not p-adic analytic, contains a free nonabelian subgroup, but not a free pro-p group. We also conjecture that the group G has finite width 3 and finite average width 8/3.

Explore related subjects

Keep this discovery

BibTeXRIS

Norbert Peyerimhoff, Alina Vdovina. 2008-09-09. Cayley Graph Expanders and Groups of Finite Width. https://arxiv.org/abs/0809.1560

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