Eigenvalue estimates for the poly-Laplace operator on lattice subgraphs

Bobo Hua; Ruowei Li

Eigenvalue estimates for the poly-Laplace operator on lattice subgraphs

T0 review · 0 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read Discrete poly-Laplace eigenvalues on lattice subgraphs satisfy classical asymptotic sum estimates for every order, with a strict comparison inequality between orders.

desk verdict Solid, genuinely new extension of Bauer–Lippner and Li–Yau to discrete poly-Laplace operators; main lattice theorems hold, with a formula caveat and a minor appendix flaw. read the letter →

arxiv 2411.11071 v1 pith:N6GFHX7G submitted 2024-11-17 math.SP math.APmath.DG

Bobo Hua , Ruowei Li This is my paper · ORCID

classification math.SPmath.APmath.DG MSC 35P1539A1205C50

keywords discretepoly-LaplaceoperatorDirichleteigenvalueslatticegraphintegerasymptoticeigenvalueestimatessumboundsspectralcomparisonFouriertransformonthe

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 introduces a Dirichlet version of the iterated graph Laplacian on finite subgraphs and proves that, on subgraphs of the integer lattice, the average of the first $k$ eigenvalues follows asymptotic sum rules for every order $l$. The upper bound has the same leading term as the continuous spectral asymptotics, plus an explicit boundary correction; the lower bound stays positive up to a fixed fraction of the number of vertices. A separate comparison theorem shows that the Dirichlet eigenvalue of order $2l$ is always at least the square of the eigenvalue of order $l$, and strictly larger on $\mathbb{Z}^d$. Together these results give the discrete poly-Laplace model the same asymptotic spectral shape as the continuous clamped-plate problem and provide a target for numerical discretizations.

What carries the argument

The engine is the Fourier symbol of the lattice Laplacian, $\Phi(z)=\sum_{i=1}^d(2-2\cos z_i)$, which turns $(-1)^l\Delta^l$ into multiplication by $\Phi(z)^l$ on the Fourier side. The Fourier transform converts the $\ell^2$ inner product and the quadratic form into frequency-space integrals $\int_{[-\pi,\pi]^d}\Phi(z)^l F(z)\,dz$ with $0\le F\le|\Omega|$ and $\int F=k(2\pi)^d$. The upper bound uses the elementary inequality $\Phi(z)\le|z|^2$ on a frequency ball; the lower bound uses the pointwise minorant $|z|^2-\frac{1}{12}|z|^4\le\Phi(z)$ and a radial rearrangement lemma asserting that the cheapest way to concentrate mass for this integral is a characteristic function of a ball of radius $\le\sqrt{6}$. The comparison result rests on the quadratic-form domination $\langle(\Delta^{l,D}_\Omega)^2 f,f\rangle\le\langle\Delta^{2l,D}_\Omega f,f\rangle$ together with the absence of nonzero $\ell^2$ eigenfunctions of $(-\Delta)^l$ on $\mathbb{Z}^d$.

What would settle it

For $d=2$, take $F(z)=1$ on a thin spherical shell inside $[-\pi,\pi]^2$ with fixed mass $K$, compute $\int\Phi(z)^l F(z)\,dz$ numerically, and compare it with the claimed ball-minimizer value; alternatively, diagonalize the operator on a small box such as $3\times3$ and test the averaged lower bound for every $k$ in the stated range.

Watch

Extended reading notes

Core claim

The paper's central claim is that for a finite subgraph $\Omega$ of $\mathbb{Z}^d$, the Dirichlet poly-Laplace eigenvalues satisfy two-sided sum estimates for every positive integer $l$. Theorem 1.1 gives, for $1\le k\le \min\{1,V_d/2^d\}|\Omega|$, the upper bound $\frac{1}{k}\sum_{j=1}^k\lambda_j^l \le (2\pi)^{2l}\frac{d}{d+2l}\left(\frac{k}{V_d|\Omega|}\right)^{2l/d} + \frac{|\partial^l\Omega|}{|\Omega|}$, and for $k\le\min\{1,(\sqrt{6}/(2\pi))^d V_d\}|\Omega|$ the lower bound $\lambda_k^l\ge\frac{1}{k}\sum_{j=1}^k\lambda_j^l \ge \sum_{m=0}^l \binom{l}{m}\left(-\frac{1}{12}\right)^m (2\pi)^{2(l+m)}\frac{d}{d+2(l+m)}\left(\frac{k}{V_d|\Omega|}\right)^{2(l+m)/d}>0$. Theorem 1.3 states that $(\lambda_k^l)^2\le\lambda_k^{2l}$, with strict inequality on $\mathbb{Z}^d$; the paper also proves the continuous analogue and an exhaustion approximation for infinite graphs. The lower bound is the discrete counterpart of the continuous poly-Laplace lower-bound estimates and reduces to the usual graph-Laplacian bound when $l=1$.

Load-bearing premise

The load-bearing premise is the rearrangement step in Lemma 3.3: among all nonnegative functions $F$ on $[-\pi,\pi]^d$ bounded by $M$ with fixed integral $K$, the integral of $\Phi(z)^lF(z)$ is minimized by setting $F=M$ on a Euclidean ball of radius $(K/(MV_d))^{1/d}\le\sqrt{6}$ inside the cube.

Editorial extensions

If this is right

For each positive integer $l$, the averaged first-$k$ Dirichlet spectrum of a lattice subgraph is squeezed between explicit powers of $k/(V_d|\Omega|)$, with the same leading constant as the continuous problem.
The lower bound is genuinely positive up to a constant fraction of $|\Omega|$; in particular, no Dirichlet eigenvalue can be anomalously small relative to the volume-to-spectrum scaling.
The strict inequality $(\lambda_k^l)^2<\lambda_k^{2l}$ shows that the Dirichlet poly-Laplace spectrum on $\mathbb{Z}^d$ is not obtained by exponentiating the graph-Laplacian spectrum, so separate estimates for each order are necessary.
The exhaustion theorem lets finite-subgraph eigenvalue bounds pass to infinite graphs with bounded degree, giving spectral-bottom bounds for poly-Laplace operators there.

Reading between the lines

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

Sharper trigonometric minorants for $\Phi(z)$ than the fourth-order one would extend the admissible range of $k$ and improve the lower-bound constant; this is a natural next step the paper leaves implicit.
The comparison inequality suggests a hierarchy $(\lambda_k^l)^q\le\lambda_k^{ql}$ for integer multiples of $l$; testing $q=3$ numerically would show whether the quadratic-form argument iterates.
The same Fourier-plus-rearrangement scheme should apply to other Cayley graphs with explicit symbols, such as the hexagonal or triangular lattices, with the ball radius replaced by the inradius of the fundamental frequency cell.
The appendix's convergence of eigenvalue ratios on path graphs hints that rescaled discrete Dirichlet poly-Laplace eigenvalues converge to continuous clamped-plate eigenvalues; proving this would make the new bounds a discretization tool for plate problems.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

I read this carefully, and my verdict is mostly positive. The paper delivers what it promises: the first eigenvalue sum estimates for Dirichlet poly-Laplace operators on finite subgraphs of Z^d, with constants matching the continuous Weyl law, plus the comparison inequality (λ^l_k)^2 ≤ λ^{2l}_k, strict on Z^d. I checked the lattice proofs. The Fourier representation in Lemma 2.9, the boundary estimate in Lemma 2.10, the rearrangement lower bound in Lemma 3.3, and the min-max/Cauchy–Schwarz argument for Theorem 1.3 all hold. The constants line up with Weyl asymptotics, no fitted parameters or circular steps. For l=1 it recovers Bauer–Lippner; for l≥2 the operator and estimates are new.

The main soft spot is formula (1.4). As written it claims to hold for arbitrary finite graphs, but the expansion (D−A)^l = Σ binom(l,m) D^{l−m}(−A)^m requires D and A to commute, which fails in general. On Z^d degree is constant, so D is scalar and the formula is fine; the lattice theorems survive. Still, the general-graph statement needs a regularity assumption or repair. Not load-bearing.

The second issue is the appendix. The numerical experiment has a figure but no code or data, and the Data Availability statement says no data were created, contradicting the experiment. Minor and easily fixed.

The lower bound in Theorem 1.1(b) is restricted to k ≤ min{1,(√6/(2π))^d V_d}|Ω|, so it only covers a constant fraction of eigenvalues. That is a real limitation, but it is natural for the bathtub method and does not undermine the result.

Who is this for? Spectral graph theorists and people discretizing plate/polyharmonic problems. The citation pattern is appropriate and the direct debts to Bauer–Lippner, Wang, Li–Yau, Kröger are acknowledged. I would bring it to a reading group and cite it.

Recommendation: send to a serious referee. Ask for a corrected statement of (1.4) and a proper appendix treatment. The core math is in good shape and deserves publication after minor revision.

Referee Report

0 major / 5 minor

Summary. The paper introduces a discrete poly-Laplace operator on finite subgraphs of a graph with Dirichlet boundary conditions, defined by iterating the graph Laplacian on the zero extension of a function. For finite subgraphs of the integer lattice Z^d it proves upper and lower bounds for the average of the first k Dirichlet eigenvalues with explicit constants matching the continuous Weyl asymptotics (Theorem 1.1), and a comparison inequality (λ_l_k)^2 ≤ λ_{2l}_k with strict inequality on Z^d (Theorem 1.3). The proofs use the Fourier transform on the lattice, a Kröger-type variational lemma for the upper bound, a Li-Yau-type rearrangement argument for the lower bound, and a min-max/Cauchy-Schwarz argument for the comparison theorem. An appendix gives numerical evidence on path graphs.

Significance. If correct, the results give the first eigenvalue-sum estimates for discrete poly-Laplace operators on lattice subgraphs, extending Li-Yau, Kröger, and Bauer-Lippner to higher order with explicit constants and no fitted parameters. The lower bound is positive for a constant fraction of eigenvalues, and the comparison inequality is a clean universal statement. The proofs are self-contained, and the constants are consistent with Weyl asymptotics. The main theorems should be useful for numerical analysis and spectral graph theory. A caveat is that the general-graph formula (1.4) and the ℓ2 version of Lemma 3.5 are not fully justified as stated, but these issues do not affect the lattice results.

minor comments (5)

[Lemma 3.5] The lemma is stated for f ∈ ℓ2(Z^d), but the proof treats only f ∈ C0(Z^d) by assuming a compactly supported eigenfunction. The same Fourier argument works for L2 functions, so either prove the ℓ2 case or state the lemma for compactly supported functions, which is all that Theorem 1.3 requires.
[Introduction, Eq. (1.4)] The expansion (D-A)^l = ∑ binom(l,m) D^{l-m}(-1)^m A^m is only valid when D and A commute; on a general graph with nonconstant degrees this is false, and the displayed formula for a^l_xy with deg(y) is not correct in that setting. Since all later uses are on Z^d, where D=2dI, the main theorems are unaffected, but the general-graph statement should be qualified.
[Appendix and Data Availability] The numerical experiment in the appendix reports convergence of the eigenvalue ratio but does not provide the code, the exact data, or the limiting values c_k referenced in Remark 1.4(3); the Data Availability statement that no new data were created should be reconciled with the numerical experiments.
[Theorem 1.5] The proof of Theorem 1.5 is only one sentence. The monotonicity gives the existence of the limit, but the identification of the limit with λ_l_k(G) is the substantive part of an exhaustion argument and should be spelled out or referenced.
[Throughout] The manuscript contains numerous typographical issues in the conversion, including misplaced superscripts, corrupted inequality signs, and inconsistent hyphenation of "poly-Laplace"; the final version should be carefully proofread, and the constraints in Theorem 1.1 should use proper \min spacing.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity found; the claims are proved from independent lemmas, Fourier analysis, the min-max principle, and rearrangement inequalities, with no fitted input called a prediction.

full rationale

The paper's central results, Theorems 1.1 and 1.3, are proved directly rather than assumed. The upper bound uses Lemma 3.1 (Bauer–Lippner, external) and the explicit Fourier symbol estimate; the lower bound uses Lemma 3.3, a rearrangement argument that is fully proved in the paper, including the monotonicity of the radial minorant on [0, sqrt(6)] and the ball containment condition R <= sqrt(6) < pi. Theorem 1.3 follows from the operator inequality in Lemma 3.4 and the min-max principle, with strictness proved via Lemma 3.5. No parameter is fitted to data and later renamed as a prediction; the constants are determined by the symbol and the bathtub principle. Cited works by Li–Yau, Kroger, Bauer–Lippner, and Wang are outside the present author set and are used as tools, not as self-supporting authority. The only self-citation, to Hua–Keller [16], concerns harmonic functions and is not load-bearing for the eigenvalue estimates. The numerical appendix is explicitly illustrative and not used to establish any of the theorems. The derivation chain is self-contained against the stated assumptions, so the appropriate finding is no significant circularity.

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

The proof has no fitted constants and introduces no new physical entities. The discrete Dirichlet poly-Laplace operator is a mathematical definition, not a postulated entity with independent evidence requirements. The listed axioms are the standard spectral and Fourier background plus the regularity of the lattice that makes the symbol calculus valid.

assumptions (5)

standard math Spectral theorem and min-max (Rayleigh-Ritz) principle for finite self-adjoint operators.
Underpins Lemma 3.1 and the eigenvalue characterizations in Theorem 1.3.
standard math Plancherel formula and Fourier inversion on Z^d for ℓ^2 functions.
Used in Lemma 2.9 to turn ℓ^2 norms and Dirichlet forms into integrals over [-π,π]^d.
domain assumption The integer lattice Z^d is regular with degree 2d, so the degree matrix D commutes with the adjacency matrix A.
Makes the binomial expansion (1.4) of (-Δ)^l valid and supports the coefficient bound |a^l_xy| ≤ 4^l d^l in Lemma 2.10; the paper does not state this regularity condition when writing (1.4) for general graphs.
standard math For each positive λ, the level set {z in [-π,π]^d : Φ(z)^l = λ} has Lebesgue measure zero.
Needed in Lemma 3.5 to prove there is no nonzero ℓ^2 eigenfunction of the poly-Laplace operator on Z^d.
standard math The elementary inequality 2-2cos x ≥ x^2 - x^4/12 for |x| ≤ π, and monotonicity of the resulting radial minorant (r^2 - r^4/12)^l on [0,√6].
The lower-bound Lemma 3.3 is built on this pointwise minorant and on the ball rearrangement it enables.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Eigenvalue estimates for the poly-Laplace operator on lattice subgraphs." pith.science (2026). https://pith.science/paper/N6GFHX7G

@misc{pith2026241111071,
  author       = {Pith},
  title        = {Pith review of: Eigenvalue estimates for the poly-Laplace operator on lattice subgraphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/N6GFHX7G}},
  note         = {Machine review of arXiv:2411.11071}
}

abstract

We introduce the discrete poly-Laplace operator on a subgraph with Dirichlet boundary condition. We obtain upper and lower bounds for the sum of the first $k$ Dirichlet eigenvalues of the poly-Laplace operators on a finite subgraph of lattice graph $\mathbb{Z}^{d}$ extending classical results of Li-Yau and Kr\"oger. Moreover, we prove that the Dirichlet $2l$-order poly-Laplace eigenvalues are at least as large as the squares of the Dirichlet $l$-order poly-Laplace eigenvalues.

Figures

Figures reproduced from arXiv: 2411.11071 by the authors.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 35 canonical work pages

[1]

On kernels, eigenvalues, and eigenfuncti ons of operators related to elliptic problems

Shmuel Agmon. On kernels, eigenvalues, and eigenfuncti ons of operators related to elliptic problems. Comm. Pure Appl. Math. , 18:627–663, 1965. 1

work page 1965
[2]

Eigenvalue sum estimates for lattice subgraphs

Frank Bauer and Gabor Lippner. Eigenvalue sum estimates for lattice subgraphs. Pure and Applied Mathematics Quarterly , 18(6):2339–2353, 2022. 1, 1, 1, 2.1, 3, 3.1

work page 2022
[3]

F. A. Berezin. Covariant and contravariant symbols of op erators. Izv. Akad. Nauk SSSR Ser. Mat. , 36:1134–1167, 1972. 1

work page 1972
[4]

Asymptotic behavior of the sp ectrum of diﬀerential equations

M Sh Birman and MZ Solomyak. Asymptotic behavior of the sp ectrum of diﬀerential equations. Journal of Soviet Mathematics , 12:247–283, 1979. 1 22 BOBO HUA AND RUOWEI LI

work page 1979
[5]

M. ˇ S. Birman and M. Z. Solomjak. Quantitative analysis in Sobolev imbedding theorems and applications to spectral theory , volume 114 of American Mathematical Society Translations, Series 2 . American Mathematical Society, Providence, RI, 1980. Translated from the Russian by F. A. Cezus. 1

work page 1980
[6]

A lower boun d for eigenvalues of the poly-Laplacian with arbitrary order

Qing-Ming Cheng, Xuerong Qi, and Guoxin Wei. A lower boun d for eigenvalues of the poly-Laplacian with arbitrary order. Paciﬁc J. Math. , 262(1):35–47, 2013. 1

work page 2013
[7]

Upper and lower bounds fo r eigenvalues of the clamped plate problem

Qing-Ming Cheng and Guoxin Wei. Upper and lower bounds fo r eigenvalues of the clamped plate problem. J. Diﬀerential Equations , 255(2):220–233, 2013. 1

work page 2013
[8]

Diﬀerence equations of polyharmon ic type

RJ Duﬃn and EP Shelly. Diﬀerence equations of polyharmon ic type. 1958. 1

work page 1958

Show all 36 references

[9]

Discrete bi-laplacians and bi harmonic b-splines

Powei Feng and Joe Warren. Discrete bi-laplacians and bi harmonic b-splines. ACM Transactions on Graphics (TOG) , 31(4):1–11, 2012. 1

2012
[10]

Lieb-Thirring inequalities for higher order diﬀerential operators

Clemens F¨ orster and J¨ orgen ¨Ostensson. Lieb-Thirring inequalities for higher order diﬀerential operators. Math. Nachr. , 281(2):199–213, 2008. 1

2008
[11]

Polyharmonic bound- ary value problems , volume 1991 of Lecture Notes in Mathematics

Filippo Gazzola, Hans-Christoph Grunau, and Guido Swe ers. Polyharmonic bound- ary value problems , volume 1991 of Lecture Notes in Mathematics . Springer-Verlag, Berlin, 2010. Positivity preserving and nonlinear higher o rder elliptic equations in bounded domains. 1

1991
[12]

The laplacian spec- trum of a graph

Robert Grone, Russell Merris, and Viakalathur Shankar Sunder. The laplacian spec- trum of a graph. SIAM Journal on matrix analysis and applications , 11(2):218–238,
[13]

Graph embeddings an d laplacian eigenvalues

Stephen Guattery and Gary L Miller. Graph embeddings an d laplacian eigenvalues. SIAM Journal on Matrix Analysis and Applications , 21(3):703–723, 2000. 1

2000
[14]

Extremum problems for eigenvalues of elliptic operators

Antoine Henrot. Extremum problems for eigenvalues of elliptic operators . Frontiers in Mathematics. Birkh¨ auser Verlag, Basel, 2006. 1

2006
[15]

Laplace and bi-la place equations for directed networks and markov chains

Thomas Hirschler and Wolfgang Woess. Laplace and bi-la place equations for directed networks and markov chains. Expositiones Mathematicae, 39(2):271–301, 2021. 1

2021
[16]

Harmonic functions of gen eral graph laplacians

Bobo Hua and Matthias Keller. Harmonic functions of gen eral graph laplacians. Cal- culus of Variations and Partial Diﬀerential Equations , 51(1):343–362, 2014. 1

2014
[17]

Universal bounds for eigenvalues of the polyharmonic operators

J¨ urgen Jost, Xianqing Li-Jost, Qiaoling Wang, and Cha ngyu Xia. Universal bounds for eigenvalues of the polyharmonic operators. Trans. Amer. Math. Soc., 363(4):1821– 1854, 2011. 1

2011
[18]

Expan- sion of eigenvalues of rank-one perturbations of the discre te bilaplacian

Ahmad Khalkhuzhaev, Shokhrukh Yu Kholmatov, and Mardo n Pardabaev. Expan- sion of eigenvalues of rank-one perturbations of the discre te bilaplacian. arXiv preprint arXiv:1910.01369, 2019. 1

1910 arXiv
[19]

Two- dimensional Berezin-Li- Yau inequalities with a correction term

Hynek Kovaˇ r ´ ık, Semjon Vugalter, and Timo Weidl. Two- dimensional Berezin-Li- Yau inequalities with a correction term. Comm. Math. Phys. , 287(3):959–981, 2009. 1

2009
[20]

Kr¨ oger

P. Kr¨ oger. Upper bounds for the Neumann eigenvalues on a bounded domain in Euclidean space. J. Funct. Anal. , 106(2):353–357, 1992. 1

1992
[21]

Estimates for sums of eigenvalues of the Laplacian

Pawel Kr¨ oger. Estimates for sums of eigenvalues of the Laplacian. J. Funct. Anal. , 126(1):217–227, 1994. 1, 1, 3

1994
[22]

´Equations aux D´ eriv´ ees Partielles

Ari Laptev and Timo Weidl. Recent results on Lieb-Thirr ing inequalities. In Journ´ ees “ ´Equations aux D´ eriv´ ees Partielles” (La Chapelle sur Erdre, 2000) , pages Exp. No. XX, 14. Univ. Nantes, Nantes, 2000. 1

2000
[23]

H. A. Levine and M. H. Protter. Unrestricted lower bound s for eigenvalues for classes of elliptic equations and systems of equations with applica tions to problems in elas- ticity. Math. Methods Appl. Sci. , 7(2):210–222, 1985. 1

1985
[24]

On the Schr¨ odinger equatio n and the eigenvalue prob- lem

Peter Li and Shing Tung Yau. On the Schr¨ odinger equatio n and the eigenvalue prob- lem. Comm. Math. Phys. , 88(3):309–318, 1983. 1, 1, 1, 3, 3.2, 3.3

1983
[25]

Elliott H. Lieb. The number of bound states of one-body S chroedinger operators and the Weyl problem. In Geometry of the Laplace operator (Proc. Sympos. Pure Math., Univ. Hawaii, Honolulu, Hawaii, 1979) , volume XXXVI of Proc. Sympos. Pure Math., pages 241–252. Amer. Math. Soc...

1979
[26]

Antonios D. Melas. A lower bound for sums of eigenvalues of the Laplacian. Proc. Amer. Math. Soc. , 131(2):631–636, 2003. 1

2003
[27]

Netrusov and T

Y. Netrusov and T. Weidl. On Lieb-Thirring inequalitie s for higher order operators with critical and subcritical powers. Comm. Math. Phys. , 182(2):355–370, 1996. 1

1996
[28]

On the eigenvalues and eigenfunctions of elast ic plates

˚ A ke Pleijel. On the eigenvalues and eigenfunctions of elast ic plates. Comm. Pure Appl. Math. , 3:1–10, 1950. 1

1950
[29]

G. P´ olya. On the eigenvalues of vibrating membranes. Proc. London Math. Soc. (3) , 11:419–433, 1961. 1

1961
[30]

On the membrane model and the discrete Bilaplacian

Florian Martin Schweiger. On the membrane model and the discrete Bilaplacian . PhD thesis, Universit¨ ats-und Landesbibliothek Bonn, 2021. 1

2021
[31]

Strichartz

Robert S. Strichartz. Estimates for sums of eigenvalue s for domains in homogeneous spaces. J. Funct. Anal. , 137(1):152–190, 1996. 1

1996
[32]

Eigenvalue estimates for the fractional laplacian on lattice subgraphs

Jiaxuan Wang. Eigenvalue estimates for the fractional laplacian on lattice subgraphs. arXiv preprint arXiv:2303.15766 , 2023. 1

2023 arXiv
[33]

Estimates for eigenvalu es of poly-harmonic opera- tors

Guoxin Wei and Lingzhong Zeng. Estimates for eigenvalu es of poly-harmonic opera- tors. Adv. Nonlinear Stud. , 16(1):31–44, 2016. 1

2016
[34]

Das asymptotische Verteilungsgesetz de r Eigenwerte linearer par- tieller Diﬀerentialgleichungen (mit einer Anwendung auf d ie Theorie der Hohlraum- strahlung)

Hermann Weyl. Das asymptotische Verteilungsgesetz de r Eigenwerte linearer par- tieller Diﬀerentialgleichungen (mit einer Anwendung auf d ie Theorie der Hohlraum- strahlung). Math. Ann. , 71(4):441–479, 1912. 1

1912
[35]

Eigenvalue bounds for the poly-harmonic operators

Selma Yıldırı m Yolcu and T¨ urkay Yolcu. Eigenvalue bounds for the poly-harmonic operators. Illinois J. Math. , 58(3):847–865, 2014. 1

2014
[36]

Multidimensio nal lower bounds for the eigenvalues of Stokes and Dirichlet Laplacian operators

Selma Yıldırı m Yolcu and T¨ urkay Yolcu. Multidimensio nal lower bounds for the eigenvalues of Stokes and Dirichlet Laplacian operators. J. Math. Phys. , 53(4):043508, 17, 2012. 1 Bobo Hua: School of Mathematical Sciences, LMNS, Fudan Univ ersity, Shanghai 200433, China; Shan...

2012

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.

[1] [1]

On kernels, eigenvalues, and eigenfuncti ons of operators related to elliptic problems

Shmuel Agmon. On kernels, eigenvalues, and eigenfuncti ons of operators related to elliptic problems. Comm. Pure Appl. Math. , 18:627–663, 1965. 1

work page 1965

[2] [2]

Eigenvalue sum estimates for lattice subgraphs

Frank Bauer and Gabor Lippner. Eigenvalue sum estimates for lattice subgraphs. Pure and Applied Mathematics Quarterly , 18(6):2339–2353, 2022. 1, 1, 1, 2.1, 3, 3.1

work page 2022

[3] [3]

F. A. Berezin. Covariant and contravariant symbols of op erators. Izv. Akad. Nauk SSSR Ser. Mat. , 36:1134–1167, 1972. 1

work page 1972

[4] [4]

Asymptotic behavior of the sp ectrum of diﬀerential equations

M Sh Birman and MZ Solomyak. Asymptotic behavior of the sp ectrum of diﬀerential equations. Journal of Soviet Mathematics , 12:247–283, 1979. 1 22 BOBO HUA AND RUOWEI LI

work page 1979

[5] [5]

M. ˇ S. Birman and M. Z. Solomjak. Quantitative analysis in Sobolev imbedding theorems and applications to spectral theory , volume 114 of American Mathematical Society Translations, Series 2 . American Mathematical Society, Providence, RI, 1980. Translated from the Russian by F. A. Cezus. 1

work page 1980

[6] [6]

A lower boun d for eigenvalues of the poly-Laplacian with arbitrary order

Qing-Ming Cheng, Xuerong Qi, and Guoxin Wei. A lower boun d for eigenvalues of the poly-Laplacian with arbitrary order. Paciﬁc J. Math. , 262(1):35–47, 2013. 1

work page 2013

[7] [7]

Upper and lower bounds fo r eigenvalues of the clamped plate problem

Qing-Ming Cheng and Guoxin Wei. Upper and lower bounds fo r eigenvalues of the clamped plate problem. J. Diﬀerential Equations , 255(2):220–233, 2013. 1

work page 2013

[8] [8]

Diﬀerence equations of polyharmon ic type

RJ Duﬃn and EP Shelly. Diﬀerence equations of polyharmon ic type. 1958. 1

work page 1958