University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The arithmetic structure of the spectrum of a metric graph

The arithmetic structure of the spectrum of a metric graph

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

OOEW04 - Structure and Randomness - a celebration of the mathematics of Timothy Gowers

Endowing a finite combinatorial graph with lengths on its edges defines singular 1-dimensional Riemannian manifolds known as metric graphs. The spectra of their Laplacians have been widely studied.We show that these spectra have a structured linear part described in terms of arithmetic progressions and a nonlinear ”random” part which is highly linearly and even algebraically independent over the rationals.These spectra give rise to exotic crystalline measures and resolve various open problems concerning them. Joint work with Pavel Kurasov.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity