The additive structure of the spectra of quantum graphs and discrete measures

Abstract: It is proven that the spectrum of the Laplacian on a metric graph $\Gamma$ contains arithmetic sequences if and only if the graph has a loop -- an edge connected to one vertex by both end points. Moreover the length of the longest possible arithmetic subsequence is estimated using the corresponding discrete graph $G$. Our main tool is diophantine analysis, specifically ''Lang's $G_m $ Conjecture'' concerning the intersection of the division group of a finitely generated subgroup of $(\mathbb C^*)^N$ with a subvariety of $(\mathbb C^*)^N$. On our way we prove recent Colin de Verdière's Conjecture concerning structure of polynomials associated with metric graphs.

The trace formula connecting spectra of standard Laplacians on metric graphs to the sets of periodic orbits allows us to construct a large family of exotic crystalline measures, studied recently by Y. Meyer. Crystalline measures are discrete measures with Fourier transform being a discrete measure as well. Our analysis in the first part imply that constructed measures are not just combinations of Poisson summation formulae.

This is a joint work with Peter Sarnak.

high energy physicsmathematical physicsanalysis of PDEsspectral theory

Audience: researchers in the topic

---

Scattering, microlocal analysis and renormalisation

Series comments: Mondays: aarhusuniversity.zoom.us/j/9036772485 Meeting ID: 903 677 2485

Thursdays: us02web.zoom.us/j/6094800950 Meeting ID: 609 480 0950

Please e-mail the organizers for the password meeting. Please keep in mind that the schedule on researchseminars.org might refer to your local time zone.

Links to the slides can be found here: drive.google.com/file/d/1uu6ZvU6zlGalJpZR7ZDi7igsvBMBylOA/view

---