Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We confirm, for the primes up to 3000, the conjecture of Bourgain-Gamburd-Sarnak and Baragar on strong approximation for the Markoff surface modulo primes. For primes congruent to 3 modulo 4, we find data suggesting that some natural graphs constructed from this equation are asymptotically Ramanujan. For primes congruent to 1 modulo 4, the data suggest a weaker spectral gap. In both cases, there is close agreement with the Kesten-McKay law for the density of states for random 3-regular graphs. We also study the connectedness of other level sets . In the degenerate case of the Cayley cubic, we give a complete description of the orbits.
Anjali Bagunu Tarun, Hamid Behjat
Paolo De Los Rios, Bruno Claude Daniel Fauvet, Satyam Tiwari