Resolving isospectral ‘drums’ by counting nodal domains

DOI10.1088/0305-4470/38/41/006zbMath1082.58032arXivnlin/0504050OpenAlexW3106238724WikidataQ62596112 ScholiaQ62596112MaRDI QIDQ5703419

Uzy Smilansky, Niels Søndergaard, Sven Gnutzmann

Publication date: 8 November 2005

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/nlin/0504050

Mathematics Subject Classification ID

Spectral problems; spectral geometry; scattering theory on manifolds (58J50) Isospectrality (58J53)

Related Items

Isospectral discrete and quantum graphs with the same flip counts and nodal counts ⋮ Topological properties of Neumann domains ⋮ Nodal statistics on quantum graphs ⋮ The nodal count {0,1,2,3,…} implies the graph is a tree ⋮ Neumann nodal domains ⋮ Critical partitions and nodal deficiency of billiard eigenfunctions ⋮ Dynamics of nodal points and the nodal count on a family of quantum graphs ⋮ A geometric construction of isospectral magnetic graphs ⋮ The number of nodal domains on quantum graphs as a stability index of graph partitions ⋮ Nodal domain count for the generalized graph \(p\)-Laplacian ⋮ On the nodal count for flat tori ⋮ Neumann domains on quantum graphs ⋮ A lower bound for nodal count on discrete and metric graphs ⋮ Can One Count the Shape of a Drum?