2000 character limit reached
Logarithmic bounds for the diameters of some Cayley graphs
Published 13 Oct 2019 in math.GR and math.NT | (1910.05718v3)
Abstract: Let $S\subset\text{GL}_n(\mathbb Z)$ be a finite symmetric set. We show that if the Zariski closure of $\Gamma=\langle S\rangle$ is a product of $\text{SL}_d$ or a special affine linear group, then the diameter of the Cayley graph $\text{Cay}(\Gamma/\Gamma(q),\pi_q(S))$ is $O(\log q)$, where $q$ is an arbitrary positive integer, $\pi_q:\Gamma\to \Gamma/\Gamma(q)$ is the canonical projection induced by the reduction modulo $q$, and the implied constant depends only on $S$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.