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 (9)

• Periodic Orbit Theory and Spectral Statistics for Quantum Graphs
• Kirchhoff's Rule for Quantum Wires
• Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
• Can One Hear the Shape of a Graph?
• Quantum graphs: an introduction and a brief survey
• Resolving isospectral "drums" by counting nodal domains
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality ?
• Isospectral domains with mixed boundary conditions
• Remarks on "Resolving isospectral `drums' by counting nodal domains"

Cited by in corpus (29)

• Are Scattering Properties of Graphs Uniquely Connected to Their Shapes?
• Nodal portraits of quantum billiards: Domains, lines, and statistics
• Chaos in Dirac electron optics: Emergence of a relativistic quantum chimera
• Linear Representations and Isospectrality with Boundary Conditions
• Scattering from isospectral quantum graphs
• Green's function approach for quantum graphs: an overview
• GSE statistics without spin
• Semiclassical approach to discrete symmetries in quantum chaos
• Dynamics of nodal points and the nodal count on a family of quantum graphs
• Resonances and poles in isoscattering microwave networks and graphs
• Isospectral graphs with identical nodal counts
• An elementary introduction to quantum graphs
• Quantum Graphs: $\mathcal{P}\mathcal{T}$-symmetry and reflection symmetry of the spectrum
• A geometric construction of isospectral magnetic graphs
• Isospectrality and heat content
• Inverse lattice design and its application to bent waveguides
• Spectral Properties of Quantum Circulant Graphs
• Torsional Rigidity, Isospectrality and Quantum Graphs
• Quantum graphs -- Generic eigenfunctions and their nodal count and Neumann count statistics
• Families of isospectral and isoscattering quantum graphs
• Can One Hear the Spanning Trees of a Quantum Graph?
• Eigenspaces of symmetric graphs are not typically irreducible
• On G-sets and Isospectrality
• Multi-user QKD using quotient graph states derived from continuous-variable dual-rail cluster states
• Quasi-isospectrality on quantum graphs
• Note on the role of symmetry in scattering from isospectral graphs and drums
• Topologically induced spectral behavior: the example of quantum graphs
• Finite deficiency indices and uniform remainder in Weyl's law
• Generating isospectral but not isomorphic quantum graphs