SearcharxivSearch

arXiv · 2608.23457

Eigenvalues and eigenfunctions of the fractional Laplacian on the interval

Abstract

We prove a three-term asymptotic formula for the eigenvalues of the fractional Laplacian on the bounded interval $(-1,1)$. This improves the eigenvalue asymptotics of Kulczycki--Kwaśnicki--Małecki--Stós and Kwaśnicki, and confirms the conjectural $O_α(n^{-2})$ remainder suggested by the numerical simulations of Kaleta--Kwaśnicki--Małecki. Moreover, we prove that the normalized eigenfunctions are bounded uniformly in the eigenvalue index $n$ and the fractional order $α$. This settles the conjecture proposed by Kwaśnicki through numerical experiments. Furthermore, we prove that the $n$-th eigenfunction has exactly $n-1$ zeros in the interval $(-1,1)$ and every zero is simple, and hence there are exactly $n$ nodal domains. A key ingredient in the proof is an explicit representation of the eigenfunction.

Explore related subjects

Keep this discovery

BibTeXRIS

Cheng Zhang. 2026-09-08. Eigenvalues and eigenfunctions of the fractional Laplacian on the interval. https://arxiv.org/abs/2608.23457

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Mathematical and numerical analysis of quantum signal processing

Quantum signal processing (QSP) provides a representation of scalar polynomials of degree $d$ as products of matrices in $\mathrm{SU}(2)$, parameterized by $(d+1)$ real numbers known as phase factors. QSP is the mathematical foundation of quantum singular value transformation (QSVT), which is often regarded as one of the most important quantum algorithms of the past decade, with a wide range of applications in scientific computing, from Hamiltonian simulation to solving linear systems of equations and eigenvalue problems. In this article we survey recent advances in the mathematical and numerical analysis of QSP. In particular, we focus on its generalization beyond polynomials, the computational complexity of algorithms for phase factor evaluation, and the numerical stability of such algorithms. The resolution to some of these problems relies on an unexpected interplay between QSP, nonlinear Fourier analysis on $\mathrm{SU}(2)$, fast polynomial multiplications, and Gaussian elimination for matrices with displacement structure.

quant-ph

The maximum entropy state

We give an algorithm for calculating the maximum entropy state as the least fixed point of a Scott continuous mapping on the domain of classical states in their Bayesian order.

math.PR

Terminating Zero-Balanced Hypergeometric Series Using Divided Differences

There is a close relationship between divided differences and hypergeometric series, and recent studies have shown that divided differences can be used effectively to derive terminating hypergeometric identities. In this paper, we apply this approach to terminating zero-balanced hypergeometric series. Using explicit product evaluations arising from divided differences, we give alternative proofs of zero-balanced ${}_3F_2(1)$ and ${}_4F_3(1)$ summation formulas and then extend the argument to the general terminating ${}_{r+1}F_r(1)$ case. We also combine the Lagrange representation with the Leibniz rule for divided differences to derive a finite convolution transformation for a terminating ${}_{r+2}F_{r+1}(1)$ series. Thus, the divided-difference approach not only reproduces the known zero-balanced summation formulas but also yields a finite convolution transformation for terminating hypergeometric series, together with its zero-balanced specialization.

math.CA