Related papers: Bounds on the multiplicity of eigenvalues for fixe…
In this paper we study the structure and give bounds for the eigenvalues of the $n\times n$ matrix, which $ij$ entry is $(i,j)^\alpha[i,j]^\beta$, where $\alpha,\beta\in\Rset$, $(i,j)$ is the greatest common divisor of $i$ and $j$ and…
Call a permutation $k$-inflatable if the sequence of its tensor products with uniform random permutations of increasing lengths has uniform $k$-point pattern densities. Previous work has shown that nontrivial $k$-inflatable permutations do…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
We consider the following eigenvalue optimization problem: Given a bounded domain $\Omega\subset\R^n$ and numbers $\alpha\geq 0$, $A\in [0,|\Omega|]$, find a subset $D\subset\Omega$ of area $A$ for which the first Dirichlet eigenvalue of…
In this paper, we study eigenvalues of a clamped plate problem. We obtain a lower bound for eigenvalues, which gives an important improvement of results due to Levine and Protter.
We show that a point set of cardinality $n$ in the plane cannot be the vertex set of more than $59^n O(n^{-6})$ straight-edge triangulations of its convex hull. This improves the previous upper bound of $276.75^n$.
We have found the minimal difference $\Delta(k) = \min\limits_P (f_{d-1}(P) - f_{0}(P))$ between the number of facets and the number of vertices of a $k$-neighborly $d$-polytope $P$ for the case $f_{0}(P) = d+3$: $\Delta(2) = 4$, $\Delta(3)…
Sharp upper bounds for the first eigenvalue of the Laplacian on a surface of a fixed area are known only in genera zero and one. We investigate the genus two case and conjecture that the first eigenvalue is maximized on a singular surface…
We show that the ball does not maximize the first nonzero Steklov eigenvalue among all contractible domains of fixed boundary volume in $\mathbb{R}^n$ when $n \geq 3$. This is in contrast to the situation when $n=2$, where a result of…
Jiang, Tidor, Yao, Zhang, and Zhao recently showed that connected bounded degree graphs have sublinear second eigenvalue multiplicity (always referring to the adjacency matrix). This result was a key step in the solution to the problem of…
An upper bound on the first S^1 invariant eigenvalue of the Laplacian for invariant metrics on the 2-sphere is used to find obstructions to the existence of isometric embeddings of such metrics in (R^3,can). As a corollary we prove: If the…
The structured pseudospectra of a matrix A are sets of complex numbers that are eigenvalues of matrices X which are near to A and have the same entries as A at a fixed set of places. The sum of multiplicities of the eigenvalues of X inside…
We investigate the regularity of the free boundaries in the 3 elastic membranes problem. We show that the two free boundaries corresponding to the coincidence regions between consecutive membranes are $C^{1,\log}$-hypersurfaces near a…
We consider computing the $k$-th eigenvalue and its corresponding eigenvector of a generalized Hermitian eigenvalue problem of $n\times n$ large sparse matrices. In electronic structure calculations, several properties of materials, such as…
Let $NPO(k)$ be the smallest number $n$ such that the adjacency matrix of any undirected graph with $n$ vertices or more has at least $k$ nonpositive eigenvalues. We show that $NPO(k)$ is well-defined and prove that the values of $NPO(k)$…
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…
We show that metrics that maximize the k-th Steklov eigenvalue on surfaces with boundary arise from free boundary minimal surfaces in the unit ball. We prove several properties of the volumes of these minimal submanifolds. For free boundary…
In a previous paper [arXiv:1111.2389], we studied the multi-brane solutions in cubic string field theory by focusing on the topological nature of the "winding number" N which counts the number of branes. We found that N can be non-trivial…
We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…
We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…