Eigenvalue estimates for the poly-Laplace operator on lattice subgraphs

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 Zd 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…