Download PRIOR_ART_AND_CLAIM_BOUNDARY.md from PureOne/dirichlet-tree-polya-equality-rigidity: direct link, hf CLI and curl.
- Browser
- Download file 3.32 kB
-
https://huggingface.co/datasets/PureOne/dirichlet-tree-polya-equality-rigidity/resolve/main/PRIOR_ART_AND_CLAIM_BOUNDARY.md
- Command line
-
hf download hf://datasets/PureOne/dirichlet-tree-polya-equality-rigidity/PRIOR_ART_AND_CLAIM_BOUNDARY.md
-
curl -L -o PRIOR_ART_AND_CLAIM_BOUNDARY.md https://huggingface.co/datasets/PureOne/dirichlet-tree-polya-equality-rigidity/resolve/main/PRIOR_ART_AND_CLAIM_BOUNDARY.md
Prior Art and Claim Boundary
Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki
Date of audit: 24 September 2026
Primary source defining the open problem
Evans M. Harrell II, James B. Kennedy, Gabriel J. Ramos, Bounds on eigenvalue ratios of quantum graph Laplacians, arXiv:2603.26172, current manuscript date 24 August 2026.
The manuscript states the Dirichlet-tree lower bound
lambda_k(Gamma) >= pi^2 k^2 / L^2
and in Remark 1.7 says that the equality case had not been investigated there, conjecturing equality iff all edge lengths are integer multiples of L/k. The same question is then listed explicitly as Open Problem 1.12(3).
Earlier source of the lower bound
Harrell-Kennedy-Ramos identify their inequality as a special case of Theorem 4.7 in:
G. Berkolaiko, J. B. Kennedy, P. Kurasov, D. Mugnolo, Edge connectivity and the spectral gap of combinatorial and quantum graphs, Journal of Physics A: Mathematical and Theoretical 50 (2017), 365201.
This release does not claim the lower bound.
Established supporting tools
The release treats the following as prior mathematics:
- compact metric graph Laplacians and quadratic forms;
- min-max characterization;
- suppression/insertion of degree-two dummy vertices;
- eigenvalue continuity under edge-length perturbations;
- genericity of simple eigenvalues and generic nodal behavior on trees;
- nodal-domain restriction to the positive ground state;
- first-eigenvalue diameter lower bound for Dirichlet trees;
- interval Poincare inequality and Fourier sine spectral gap;
- standard compactness on a finite graph topology.
What this release claims as new
Subject to historical-priority review, the new content is:
- a proof of the conjectured equality characterization for every k;
- the exact spectral defect-conservation organization of the proof;
- the vanishing-branch energy-impedance lemma and its degree-sensitive form in the equality argument;
- the complete classification of equality metrics on fixed topology by integer compositions;
- the complete saturation-index theorem
S(Gamma)=empty or K0*N; - coprime-index / consecutive-index interval rigidity;
- the topological threshold saying the first possible equality index is the essential-edge count;
- fixed-topology spectral-to-arithmetic stability and unique locking below a positive threshold.
Search result at release time
A web search performed on 24 September 2026 found the current Harrell-Kennedy-Ramos version and an open-problem index still describing the equality characterization as unresolved. No later public paper resolving the exact conjecture was located in that search.
This is not an exhaustive Mathematical Reviews / zbMATH / citation-network priority audit. Authors or reviewers should perform one before asserting historical first priority in a journal submission.
Recommended public wording
Preferred:
We present a proof of the equality characterization conjectured in Harrell-Kennedy-Ramos (2026), together with strengthened rigidity and arithmetic consequences. Independent peer review and historical-priority verification are pending.
Avoid:
We have unquestionably solved a problem that nobody else has solved.
until external expert and priority review has been completed.