Related papers: On fully supported eigenfunctions of quantum graph…

We apply the techniques of our previous paper to study joint eigenfunctions of the Laplacian and one Hecke operator on compact congruence surfaces, and joint eigenfunctions of the two partial Laplacians on compact quotients of…

We use the averaged variational principle introduced in a recent article on graph spectra [7] to obtain upper bounds for sums of eigenvalues of several partial differential operators of interest in geometric analysis, which are analogues of…

Given a compact manifold $\mathcal M$ with boundary of dimension $n\geq 3$ and any integers $K$ and $N$, we show that there exists a metric on $\mathcal M$ for which the first $K$ nonconstant eigenfunctions of the Dirichlet-to-Neumann map…

We prove that $m$-dimensional Lipschitz graphs with anisotropic mean curvature bounded in $L^p$, $p>m$, are regular almost everywhere in every dimension and codimension. This provides partial or full answers to multiple open questions…

In this paper, we successfully establish a Courant-type nodal domain theorem for both the Dirichlet eigenvalue problem and the closed eigenvalue problem of the Witten-Laplacian. Moreover, we also characterize the properties of the nodal…

Let N be a complete Riemannian manifold of dimension n+1 whose Riemannian metric g is conformally equivalent to a metric with non-negative Ricci curvature. The normalized Steklov eigenvalues of a bounded domain in N are bounded above in…

We prove the existence of nontrivial unbounded domains $\O$ in the Euclidean space $\R^d$ for which the Dirichlet eigenvalue problem for the Laplacian on $\Omega$ admits sign-changing eigenfunctions with constant Neumann values on $\partial…

We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the…

We consider the sequence of nodal counts for eigenfunctions of the Laplace-Beltrami operator in two dimensional domains. It was conjectured recently that this sequence stores some information pertaining to the geometry of the domain, and we…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

\AA. Pleijel (1956) has proved that in the case of the Laplacian with Dirichlet condition, the equality in the Courant nodal theorem (Courant sharp situation) can only be true for a finite number of eigenvalues when the dimension is $\geq…

We study the structure of eigenfunctions of the Laplacian on quantum graphs, with a particular focus on Morse eigenfunctions via nodal and Neumann domains. Building on Courant-type arguments, we establish upper bounds for the number of…

We give three different proofs of the main result of Anantharaman-Le Masson, establishing quantum ergodicity -- a form of delocalization --for eigenfunctions of the laplacian on large regular graphs of fixed degree. These three proofs are…

We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard…

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…

We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…

We prove several types of Courant nodal domain theorems for generalized Laplacians on graphs, based on an invariant introduced by Urschel, which we call the "Urschel number", denoted ${\rm UN}({\bf f})$, of an eigenvector ${\bf f}$. We…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

The nodal domains of eigenvectors of the discrete Schrodinger operator on simple, finite and connected graphs are considered. Courant's well known nodal domain theorem applies in the present case, and sets an upper bound to the number of…

Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the well-known Courant's nodal domain theorem on continuous…