The Isospectral Fruits of Representation Theory: Quantum Graphs and Drums

Abstract

We present a method which enables one to construct isospectral objects, such as quantum graphs and drums. One aspect of the method is based on representation theory arguments which are shown and proved. The complementary part concerns techniques of assembly which are both stated generally and demonstrated. For that purpose, quantum graphs are grist to the mill. We develop the intuition that stands behind the construction as well as the practical skills of producing isospectral objects. We discuss the theoretical implications which include Sunada's theorem of isospectrality arising as a particular case of this method. A gallery of new isospectral examples is presented and some known examples are shown to result from our theory.

References in corpus (1)

• Nodal domains on isospectral quantum graphs: the resolution of isospectrality ?

Cited by in corpus (11)

• Are Scattering Properties of Graphs Uniquely Connected to Their Shapes?
• Semiclassical approach to discrete symmetries in quantum chaos
• Resonances and poles in isoscattering microwave networks and graphs
• Quantum Graphs: $\mathcal{P}\mathcal{T}$-symmetry and reflection symmetry of the spectrum
• A geometric construction of isospectral magnetic graphs
• Quantum graphs -- Generic eigenfunctions and their nodal count and Neumann count statistics
• Torsional Rigidity, Isospectrality and Quantum Graphs
• Families of isospectral and isoscattering quantum graphs
• Can One Hear the Spanning Trees of a Quantum Graph?
• Multi-user QKD using quotient graph states derived from continuous-variable dual-rail cluster states
• Generating isospectral but not isomorphic quantum graphs