Abstract
We surveywhat is known about spectra of combinatorial Laplacians (or adjacency operators) of graphs on the simplest finite symmetric spaces. This work is joint with J. Angel, N. Celniker, A. Medrano, P. Myers, S. Poulos, H. Stark, C. Trimble, and E.Velasquez. For each finite field Fq with q odd, we consider graphs associated to finite Euclidean and non-Euclidean symmetric spaces over Fq. We are mainly interested in three questions regarding the eigenvalues and eigenfunctions of the combinatorial Laplacian as q goes to infinity: How large is the second largest eigenvalue, in absolute value, compared with the graph's degree? (The largesteigenvalue is the degree.) What can one say about the distribution of eigenvalues? What can one say about the “level curves” of the eigenfunctions?
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.