相关论文: On strong nodal domains for eigenfunctions of Hamm…

Let $(M,g)$ be a non-compact riemannian $n$-manifold with bounded geometry at order $k\geq\frac{n}{2}$. We show that if the spectrum of the Laplacian starts with $q+1$ discrete eigenvalues isolated from the essential spectrum, and if the…

We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model $X^k(n,p)$ of random $k$-dimensional simplicial complexes on $n$…

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…

We consider the lower bound of nodal sets of Steklov eigenfunctions on smooth Riemannian manifolds with boundary--the eigenfunctions of the Dirichlet-to-Neumann map. Let $N_\lambda$ be its nodal set. Assume that zero is a regular value of…

Let $G$ be a connected simple graph of order $n$. Let $\rho_1(G)\geq \rho_2(G)\geq \cdots \geq \rho_{n-1}(G)> \rho_n(G)=0$ be the eigenvalues of the normalized Laplacian matrix $\mathcal{L}(G)$ of $G$. Denote by $m(\rho_i)$ the multiplicity…

Let $\Delta_M$ be the Laplace operator on a compact $n$-dimensional Riemannian manifold without boundary. We study the zero sets of its eigenfunctions $u:\Delta u + \lambda u =0$. In dimension $n=2$ we refine the Donnelly-Fefferman estimate…

A neutral network is a subgraph of a Hamming graph, and its principal eigenvalue determines its robustness: the ability of a population evolving on it to withstand errors. Here we consider the most robust small neutral networks: the graphs…

We study the weights of eigenvectors of the Johnson graphs $J(n,w)$. For any $i \in \{1,\ldots,w\}$ and sufficiently large $n, n\geq n(i,w)$ we show that an eigenvector of $J(n,w)$ with the eigenvalue $\lambda_i=(n-w-i)(w-i)-i$ has at least…

In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $\mathbb{R}^n$ to the graph setting. We mention…

We obtain a classification of the completely regular codes with covering radius 1 and the second eigenvalue in the Hamming graphs H(3,q) up to q and intersection array. Due to works of Meyerowitz, Mogilnykh and Valyuzenich, our result…

It has been suggested that the distribution of the suitably normalized number of zeros of Laplacian eigenfunctions contains information about the geometry of the underlying domain. We study this distribution (more precisely, the…

We study the first Dirichlet eigenfunction of the Laplacian in a $n$-dimensional convex domain. For domains of a fixed inner radius, estimates of Chiti imply that the ratio of the $L^2$-norm and $L^{\infty}$-norm of the eigenfunction is…

Let $P$ be a bounded $n$-dimensional Lipschitz polytope, and let $\varphi_{\lambda}$ be a Dirichlet Laplace eigenfunction in $P$ corresponding to the eigenvalue $\lambda$. We show that the $(n-1)$-dimensional Hausdorff measure of the nodal…

This article concerns the number of nodal domains of eigenfunctions of the Laplacian on special Riemannian $3$-manifolds, namely nontrivial principal $S^1$ bundles $P \to X$ over Riemann surfaces equipped with certain $S^1$ invariant…

For a bounded Lipschitz domain $\Sigma$ in a Riemannian surface $M$ satisfying certain curvature condition, we prove that $$\mu_{3-\beta_1} \leq \lambda_{1},$$ where $\mu_k$ ($\lambda_k$ resp.) is the $k$-th Neumann (Dirichlet resp.)…

Let $M$ be a finite volume oriented Riemannian manifold of dimension $n\geq 3$ and curvature in $[-b^2,-1]$, with thick-thin decomposition $M=M(thick)\cup M(thin)$. Denote by $\lambda_k(M(thick))$ the k-th eigenvalue for the Laplacian on…

Let $G$ be a connected graph on $n$ vertices with diameter $d$. It is known that if $2\le d\le n-2$, there are at most $n-d$ Laplacian eigenvalues in the interval $[n-d+2, n]$. In this paper, we show that if $1\le d\le n-3$, there are at…

A certain signed adjacency matrix of the hypercube, which Hao Huang used last year to resolve the sensitivity conjecture, is closely related to the unique, 4-cycle free, 2-fold cover of the hypercube. We develop a framework in which this…

Let $G$ be a graph of order $n,$ and let $q_{1}(G) \geq ...\geq q_{n}(G) $ be the eigenvalues of the $Q$-matrix of $G$, also known as the signless Laplacian of $G.$ In this paper we give a necessary and sufficient condition for the equality…

An explicit Dirichlet series is obtained, which represents an analytic function of $s$ in the half-plane $\Re s>1/2$ except for having simple poles at points $s_j$ that correspond to exceptional eigenvalues $\lambda_j$ of the non-Euclidean…