Krahn-Szegő inequalities are established for trees and the Aouchiche-Hansen conjecture is settled via a new nodal domain theorem for adjacency matrices on graphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Complete expansions of two binary polynomials yield improved optimal lower bounds for sums of Dirichlet eigenvalues of the Laplacian and poly-Laplacian.
citing papers explorer
-
Krahn--Szeg\H{o} type inequalities and nodal domain methods on graphs
Krahn-Szegő inequalities are established for trees and the Aouchiche-Hansen conjecture is settled via a new nodal domain theorem for adjacency matrices on graphs.
-
Improved lower bounds for Dirichlet eigenvalues of the Laplacian and poly-Laplacian on bounded Euclidean domains
Complete expansions of two binary polynomials yield improved optimal lower bounds for sums of Dirichlet eigenvalues of the Laplacian and poly-Laplacian.