2005/02/11 by M. Kassabov, Kassabov, M., T. R. Riley +1
Mathematics · #05C35 #20D06 #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR) #math.CO #math.GR #msc:05C25 #msc:05C35 #msc:20D06 #msc:20F05 #primary 20F05 #secondary 05C25
paper · pdf · doi:10.48550/arxiv.math/0502221
11 pages, no figures
arxiv created 2005/02/11 · arxiv updated 2009/12/01
We show that for integers k > 1 and n > 2, the diameter of the Cayley graph of SLn(Z/kZ) associated to a standard two-element generating set, is at most a constant times n2 ln k. This answers a question of A. Lubotzky concerning SLn(Fp) and is unexpected because these Cayley graphs do not form an expander family. Our proof amounts to a quick algorithm for finding short words representing elements of SLn(Z/kZ).