Related papers: Sharp bounds and monotonicity results for Neumann …
Let $\Omega=\Omega_0\setminus \overline{\Theta}\subset \mathbb{R}^n$, $n\geq 2$, where $\Omega_0$ and $\Theta$ are two open, bounded and convex sets such that $\overline{\Theta}\subset \Omega_0$ and let $\beta<0$ be a given parameter. We…
In the following work, we obtain a lower bound for the first Neumann eingevalue of the drift Laplacian $\Delta^{\varphi}$ for a family of properly embedded $[\varphi,\vec{e}_{3}]$-minimal surfaces in $\mathbb{R}^3$ with concave function…
A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…
We investigate properties of the sequences of extremal values that could be achieved by the eigenvalues of the Laplacian on Euclidean domains of unit volume, under Dirichlet and Neumann boundary conditions, respectively. In a second part,…
In this paper we extend to non-compact Riemannian manifolds with boundary the use of two important tools in the geometric analysis of compact spaces, namely, the weak maximum principle for subharmonic functions and the integration by parts.…
The eigenvalues of the Laplacian matrix for a class of directed graphs with both positive and negative weights are studied. First, a class of directed signed graphs is investigated in which one pair of nodes (either connected or not) is…
For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…
An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…
A Laplacian eigenfunction on a two-dimensional manifold dictates some natural partitions of the manifold; the most apparent one being the well studied nodal domain partition. An alternative partition is revealed by considering a set 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…
We consider a singular perturbed eigenvalue problem for Laplace operator in a cylinder with frequent interchange of type of boundary condition on a lateral surface. These boundary conditions are prescribed by partition of lateral surface in…
We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…
We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia. Then we show that there is a sufficiently small perturbation of the nonzero weights…
For the magnetic Laplacian on a bounded planar domain, imposing Neumann boundary conditions produces eigenvalues below the lowest Landau level. If the domain has two boundary components and one imposes a Neumann condition on one component…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
We seek to improve the restriction bounds of Neumann data of Laplace eigenfunctions $u_h$ by studying the $L^2$ restriction bounds of Neumann data and their $L^2$ concentration as measured by defect measures. Let $\gamma$ be a closed smooth…
Let $u$ be an eigenfunction of the Laplacian on a compact manifold with boundary, with Dirichlet or Neumann boundary conditions, and let $-\lambda^2$ be the corresponding eigenvalue. We consider the problem of estimating the maximum of $u$…
We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving…
We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
In this paper, we give some lower bounds for several eigenvalues. Firstly, we investigate the eigenvalues $\lambda_i$ of the Laplace operator and prove a sharp lower bound. Moreover, we extent this estimate of the eigenvalues to general…