Towards a theory of eigenvalue asymptotics on infinite metric graphs: the case of diagonal combs

Abstract

We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete spectrum for the Neumann Laplacian. In this regime, we establish polynomial upper and lower bounds on the k-th eigenvalue, revealing that the eigenvalues grow at a rate strictly slower than quadratic. However, once the diagonal combs transition to finite volume, their growth accelerates to a quadratic rate. Our methodology involves employing spectral geometric principles tailored for metric graphs, complemented by deriving estimates for the k-th eigenvalue on compact metric graphs.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…