Resolving isospectral "drums" by counting nodal domains

Abstract

Several types of systems were put forward during the past decades to show that there exist {\it isospectral} systems which are {\it metrically} different. One important class consists of Laplace Beltrami operators for pairs of flat tori in ${\mathbb{R}}^n$ with $n\ge 4$. We propose that the spectral ambiguity can be resolved by comparing the nodal sequences (the numbers of nodal domains of eigenfunctions, arranged by increasing eigenvalues). In the case of isospectral flat tori in four dimensions - where a 4-parameters family of isospectral pairs is known- we provide heuristic arguments supported by numerical simulations to support the conjecture that the isospectrality is resolved by the nodal count. Thus - one can {\it count} the shape of a drum (if it is designed as a flat torus in four dimensions...).

13 pages, 3 figures

References in corpus (2)

• Can One Hear the Shape of a Graph?
• Nodal domains statistics - a criterion for quantum chaos

Cited by in corpus (25)

• Hearing shapes of drums - mathematical and physical aspects of isospectrality
• The Isospectral Fruits of Representation Theory: Quantum Graphs and Drums
• On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions
• Nodal portraits of quantum billiards: Domains, lines, and statistics
• A lower bound for nodal count on discrete and metric graphs
• Can one count the shape of a drum?
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality ?
• Isospectral domains with mixed boundary conditions
• Critical partitions and nodal deficiency of billiard eigenfunctions
• The Nodal Count {0, 1, 2, 3,...} Implies The Graph is a Tree
• Dynamics of nodal points and the nodal count on a family of quantum graphs
• Isospectral graphs with identical nodal counts
• Nodal Statistics On Quantum Graphs
• Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
• Nodal domains of a non-separable problem - the right angled isosceles triangle
• Counting nodal domains on surfaces of revolution
• Nodal domains in open microwave systems
• Remarks on "Resolving isospectral `drums' by counting nodal domains"
• Inverse Nodal Problems
• A geometric construction of isospectral magnetic graphs
• Phase extraction in disordered isospectral shapes
• Neumann Domains on Quantum Graphs
• Isospectral discrete and quantum graphs with the same flip counts and nodal counts
• On the Nodal Count Statistics for Separable Systems in any Dimension
• Parity violating effects in an exotic perturbation of the rigid rotator