arXiv Analytics

Sign in

arXiv:math/0301147 [math.GR]AbstractReferencesReviewsResources

Navigating the Cayley graph of SL(2,Z/pZ)

Michael Larsen

Published 2003-01-14Version 1

This paper describes a non-deterministic polynomial-time algorithm to find a path of length O(log p loglog p) between any two vertices of the Cayley graph of SL(2,Z/pZ).

Comments: 6 pages
Categories: math.GR
Subjects: 05C25, 20F65, 68Q25, 68R10
Related articles: Most relevant | Search more
arXiv:1808.01391 [math.GR] (Published 2018-08-03)
Spectra of Cayley graphs
arXiv:1510.08659 [math.GR] (Published 2015-10-29)
Height functions for amenable groups
arXiv:1505.01475 [math.GR] (Published 2015-05-06)
Which Haar graphs are Cayley graphs?

Links

Toolbox