Ambarzumian-type theorems for Hermitian matrices with applications

Joachim Kerner; Matthias Hofmann

Ambarzumian-type theorems for Hermitian matrices with applications

T0 review · reviewed 2026-06-26 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Ambarzumian-type theorems hold for the discrete Laplacian and adjacency matrices on finite graphs.

desk verdict This note extends Ambarzumian-type theorems to Hermitian matrices on arbitrary finite graphs, with a separate argument for the zero-diagonal case including adjacency matrices. read the letter →

arxiv 2606.21589 v1 pith:XMLY66ZL submitted 2026-06-19 math.SP math-phmath.MP

Matthias Hofmann , Joachim Kerner This is my paper · ORCID

classification math.SPmath-phmath.MP

keywords AmbarzumiantheoremHermitianmatricesdiscreteLaplacianadjacencymatrixfinitegraphsinversespectraltheoryisospectrality

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper establishes that certain Hermitian matrices on finite graphs obey an Ambarzumian-type property: if their spectrum matches the spectrum of the unperturbed matrix, then any added potential term must be zero. One result covers the discrete Laplacian on arbitrary finite graphs. A separate argument handles matrices with vanishing diagonal, including adjacency matrices of graphs. This extends the 1929 continuous result of Ambarzumian to discrete settings that arise in network models and graph-based operators.

What carries the argument

Hermitian matrices with vanishing diagonal or the structure of the discrete Laplacian on finite graphs, which forces any potential to vanish when the spectrum is preserved.

What would settle it

Exhibit a finite graph together with a non-zero potential such that the eigenvalues of the perturbed matrix exactly match those of the unperturbed matrix.

Watch

Extended reading notes

Core claim

We establish an Ambarzumian-type theorem for matrices with vanishing diagonal, in particular, the adjacency matrix on finite graphs. In this way, we generalize existing results on Ambarzumian-type theorems to general finite discrete graphs. The same property is shown for the discrete Laplacian on finite graphs.

Load-bearing premise

The matrices are Hermitian and possess either vanishing diagonal entries or the precise structure of the discrete Laplacian when acting on finite graphs.

Editorial extensions

If this is right

The discrete Laplacian on every finite graph satisfies the Ambarzumian property.
Adjacency matrices on every finite graph satisfy the Ambarzumian property.
Spectral data alone determines that the potential is zero for these classes of matrices.
Results apply uniformly to all finite discrete graphs rather than to restricted families.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The same spectral uniqueness may extend to other matrix perturbations that preserve the zero-diagonal or Laplacian form.
Inverse spectral recovery on graphs becomes possible from eigenvalues alone when the matrix class is fixed.
Small-graph computations could directly test the boundary between matrices that obey the property and those that do not.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

read the letter

The main takeaway is that the authors generalize Ambarzumian-type theorems to general finite discrete graphs for Hermitian matrices, including a new argument for the adjacency matrix case with vanishing diagonal.

They take the classical 1929 result about the Neumann Laplacian not being isospectral to one with a non-zero potential and adapt it to the discrete setting. The paper claims this holds for the discrete Laplacian on any finite graph and separately for zero-diagonal Hermitian matrices like adjacency matrices.

What they do well is providing this extension using different methods for the vanishing diagonal case, which avoids relying on the same techniques as the Laplacian case. The citation to the original Ambarzumian and prior graph results looks appropriate, and there's no indication of circularity.

The soft spots are that this is presented as a note, so the proofs are likely short, and the abstract gives no concrete examples or derivations to check. The results depend on the matrices being Hermitian with the specific graph structure, and that no additional potentials alter the spectrum in unexpected ways. That assumption seems reasonable but could be where the work is most sensitive if the graphs have special symmetries.

This kind of paper is for specialists in inverse spectral theory or spectral graph theory. A reader looking for discrete versions of classical inverse problems would get some value from the generalization.

It deserves a serious referee because the claim is clearly stated and the stress-test found no internal inconsistencies or load-bearing flaws.

Referee Report

0 major / 0 minor

Summary. The manuscript investigates Ambarzumian-type theorems for Hermitian matrices, including the discrete Laplacian on finite graphs. Using different methods, it establishes such a theorem for matrices with vanishing diagonal—in particular the adjacency matrix on finite graphs—thereby generalizing prior results to general finite discrete graphs.

Significance. If the stated theorems hold, the work provides a discrete analogue of the 1929 Ambarzumian result and extends existing graph-specific versions to arbitrary finite graphs via the adjacency matrix. The explicit use of distinct methods for the vanishing-diagonal case is a positive feature that could support further applications in spectral graph theory.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance. We appreciate the recognition that the work provides a discrete analogue of the classical Ambarzumian result and extends prior graph-specific versions to arbitrary finite graphs.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity detected

full rationale

The paper's central claim is a generalization of the classical 1929 Ambarzumian result to Hermitian matrices with vanishing diagonal (including adjacency matrices of finite graphs), explicitly using different methods from prior graph-specific theorems. No load-bearing steps reduce by construction to self-citations, fitted parameters renamed as predictions, or self-definitional loops; the abstract and structure indicate independent extensions against external benchmarks. No quotes exhibit the enumerated circular patterns.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

Relies on standard linear algebra and graph theory; no free parameters, invented entities, or ad-hoc axioms indicated in the abstract.

assumptions (2)

standard math Hermitian matrices have real eigenvalues and are diagonalizable by unitary matrices.
Invoked implicitly for spectral properties of the discrete Laplacian and adjacency matrices.
domain assumption Finite graphs yield finite-dimensional matrix representations for the discrete Laplacian and adjacency operator.
Required to define the matrices under study.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Ambarzumian-type theorems for Hermitian matrices with applications." pith.science (2026). https://pith.science/paper/XMLY66ZL

@misc{pith2026260621589,
  author       = {Pith},
  title        = {Pith review of: Ambarzumian-type theorems for Hermitian matrices with applications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XMLY66ZL}},
  note         = {Machine review of arXiv:2606.21589}
}

read the original abstract

A foundational result in inverse spectral theory due to Ambarzumian (1929) states that the Neumann Laplacian on an interval is not isospectral to the Neumann Laplacian with an additional non-zero potential. In this note, our aim is to investigate Ambarzumian-type theorems for certain classes of Hermitian matrices, including well-known matrices such as the discrete Laplacian on finite graphs. In addition, using different methods, we establish an Ambarzumian-type theorem for matrices with vanishing diagonal, in particular, the adjacency matrix on finite graphs. In this way, we generalize existing results on Ambarzumian-type theorems to general finite discrete graphs.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

18 extracted references · 1 canonical work pages

[1]

Ambarzumian

V. Ambarzumian. Über eine F rage der E igenwerttheorie. Zeitschrift für Physik , 53:690--695, 1929

1929
[2]

Bifulco and J

P. Bifulco and J. Kerner. A note on A mbarzumian's theorem for quantum graphs. Arch. Math. , 123(1):95--102, 2024

2024
[3]

Bifulco, J

P. Bifulco, J. Kerner, and C. Rose. Spectral comparison results for L aplacians on discrete graphs. arXiv:2412.15937, 2024

work page arXiv 2024
[4]

Boman, P

J. Boman, P. Kurasov, and R. Suhr. Schr\" o dinger operators on graphs and geometry II . S pectral estimates for L_1 -potentials and an A mbartsumian theorem. Integral Equations Operator Theory , 90(3):Paper No. 40, 24, 2018

2018
[5]

G. Borg. Eine Umkehrung der S turm- L iouvilleschen Eigenwertaufgabe: Bestimmung der Differentialgleichung durch die Eigenwerte . Acta Mathematica , 78:1 -- 96, 1946

1946
[6]

Berman and R

A. Berman and R. J. Plemmons. Nonnegative matrices in the mathematical sciences , volume 9 of Classics in Applied Mathematics . Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994. Revised reprint of the 1979 original

1994
[7]

A. Brolin. Ambarzumian theorem for quantum graphs with magnetic potential. Math. Scand. , 131(2):391--398, 2025

2025
[8]

E. B. Davies. An inverse spectral theorem. J. Operator Theory , 69(1):195--208, 2013

2013

Show all 18 references

[9]

E. M. Harrell. On the extension of A mbarzumian's inverse spectral theorem to compact symmetric spaces. American Journal of Mathematics , 109(5):787--795, 1987

1987
[10]

Hatino g lu, J

B. Hatino g lu, J. Eakins, W. Frendreiss, L. Lamb, S. Manage, and A. Puente. Ambarzumian-type problems for discrete S chr\" o dinger operators. Complex Anal. Oper. Theory , 15(8):Paper No. 118, 13, 2021

2021
[11]

Hochstadt

H. Hochstadt. The inverse S turm- L iouville problem. Comm. Pure Appl. Math. , 26:715--729, 1973. Collection of articles dedicated to Wilhelm Magnus

1973
[12]

M. Kac. Can one hear the shape of a drum? Amer. Math. Monthly , 73(4, part II):1--23, 1966

1966
[13]

M. Kiss. An A mbarzumian-type theorem on graphs with odd cycles. Ukrainian Mathematical Journal , 74:1916–1923, 2023

1916
[14]

Keller, D

M. Keller, D. Lenz, and R. K. Wojciechowski. Graphs and D iscrete D irichlet S paces . Springer Nature Switzerland AG, 2021

2021
[15]

P. Kurasov. Understanding quantum graphs. Acta Physica Polonica A , 136(5), 2019

2019
[16]

Levinson

N. Levinson. The inverse S turm- L iouville problem. Mat. Tidsskr. B , 1949:25--30, 1949

1949
[17]

B. M. Levitan and M. G. Gasymov. Determination of a differential equation by two spectra. Uspehi Mat. Nauk , 19(2(116)):3--63, 1964

1964
[18]

Pivovarchik

V. Pivovarchik. Ambarzumian’s theorem for a S turm- L iouville boundary value problem on a star-shaped graph. Funct Anal Its Appl , 39:148–151, 2005

2005

Pith tools

Reviewed June 26, 2026 · model on record in the stance chip above.

[1] [1]

Ambarzumian

V. Ambarzumian. Über eine F rage der E igenwerttheorie. Zeitschrift für Physik , 53:690--695, 1929

1929

[2] [2]

Bifulco and J

P. Bifulco and J. Kerner. A note on A mbarzumian's theorem for quantum graphs. Arch. Math. , 123(1):95--102, 2024

2024

[3] [3]

Bifulco, J

P. Bifulco, J. Kerner, and C. Rose. Spectral comparison results for L aplacians on discrete graphs. arXiv:2412.15937, 2024

work page arXiv 2024

[4] [4]

Boman, P

J. Boman, P. Kurasov, and R. Suhr. Schr\" o dinger operators on graphs and geometry II . S pectral estimates for L_1 -potentials and an A mbartsumian theorem. Integral Equations Operator Theory , 90(3):Paper No. 40, 24, 2018

2018

[5] [5]

G. Borg. Eine Umkehrung der S turm- L iouvilleschen Eigenwertaufgabe: Bestimmung der Differentialgleichung durch die Eigenwerte . Acta Mathematica , 78:1 -- 96, 1946

1946

[6] [6]

Berman and R

A. Berman and R. J. Plemmons. Nonnegative matrices in the mathematical sciences , volume 9 of Classics in Applied Mathematics . Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994. Revised reprint of the 1979 original

1994

[7] [7]

A. Brolin. Ambarzumian theorem for quantum graphs with magnetic potential. Math. Scand. , 131(2):391--398, 2025

2025

[8] [8]

E. B. Davies. An inverse spectral theorem. J. Operator Theory , 69(1):195--208, 2013

2013