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

Simple item page
dc.creatorLarsen, Michael
dc.date2003-01-14
dc.date.accessioned2026-07-07T04:54:27Z
dc.date.available2026-07-07T04:54:27Z
dc.descriptionThis 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).
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/math/0301147
dc.identifierhttp://arxiv.org/abs/math/0301147
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66256
dc.subjectGroup Theory
dc.subject05C25 (Primary) 20F65, 68Q25, 68R10 (Secondary)
dc.titleNavigating the Cayley graph of SL(2,Z/pZ)
dc.typetext

Files

Collections

arXiv