Papers
Topics
Authors
Recent
Search
2000 character limit reached

Laplace and Schrödinger operators without eigenvalues on homogeneous amenable graphs

Published 26 Feb 2021 in math.SP, math-ph, math.GR, and math.MP | (2102.13542v4)

Abstract: A one-by-one exhaustion is a combinatorial/geometric condition which excludes eigenvalues from the spectra of Laplace and Schr\"odinger operators on graphs. Isoperimetric inequalities in graphs with a cocompact automorphism group provide an upper bound on the von Neumann dimension of the space of eigenfunctions. Any finitely generated indicable amenable group has a Cayley graph without eigenvalues. There exists a finitely generated group G with finite generating sets S and S' such that the adjacency operator of the Cayley graph of (G,S) has no eigenvalue while the adjacency operator of the Cayley graph of (G,S') has pure point spectrum.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.