Related papers: Diameters, distortion and eigenvalues

On the unit interval (I), and the Sierpinski Gasket ($\mathcal{SG}$), the spectral decimation function of the Laplacian has similar properties that result in positive minimum spacing of eigenvalues. Other fractals, for example the level-3…

In this paper, we compute universal estimates of eigenvalues of a coupled system of elliptic differential equations in divergence form on a bounded domain in Euclidean space. As an application, we show an interesting case of rigidity…

We study the spectrum of the Dirichlet Laplacian operator in a two-dimensional twisted strip embedded in $\mathbb R^d$ with $d \geq 2$. It is shown that a local twisting perturbation can create discrete eigenvalues for the operator. In…

We consider the torsional rigidity and the principal eigenvalue related to the $p$-Laplace operator. The goal is to find upper and lower bounds to products of suitable powers of the quantities above in various classes of domains. The limit…

We study the volume growth of metric balls as a function of the radius in discrete spaces, and focus on the relationship between volume growth and discrete curvature. We improve volume growth bounds under a lower bound on the so-called…

Let $G$ be a simple connected undirected graph. The Laplacian spectral ratio of $G$, denoted by $R_L(G)$, is defined as the quotient between the largest and second smallest Laplacian eigenvalues of $G$, which is closely related to the…

Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…

Let $D(G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $\delta_{D^G} = \rho_1 - \rho_2$, where $\rho_1$ and $\rho_2$ represent the largest and second largest…

In this paper we give a method to geometrically modify an open set such that the first $k$ eigenvalues of the Dirichlet Laplacian and its perimeter are not increasing, its measure remains constant, and both perimeter and diameter decrease…

We give a mathematically rigorous construction of a magnetic Schr\"odinger operator corresponding to a field with flux through finitely many holes of the Sierpinski Gasket. The operator is shown to have discrete spectrum accumulating at…

Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient…

We obtain upper bounds for the first Dirichlet eigenvalue of a tube around a complex submanifold $P$ of $CP^n$ which depends only on the radius of the tube, the degrees of the polynomials defining $P$ and the first eigenvalue of some model…

We consider the minmax Ljusternik-Schnirelmann levels of the constrained $p-$Dirichlet integral, on a general open set of the Euclidean space. We show that, whenever one of these levels lies below the threshold given by the $L^p$ Poincar\'e…

We study the eigenvalues of the Laplacian on ellipsoids that are obtained as perturbations of the standard Euclidean unit sphere in dimension two. A comparison of these eigenvalues with those of the standard Euclidean unit sphere is…

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance…

We consider the eigenvalues of an elliptic operator for systems with bounded, measurable, and symmetric coefficients. We assume we have two non-empty, open, disjoint, and bounded sets and add a set of small measure to form the perturbed…

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

We study the eigenvalue problem for the Dirichlet Laplacian in bounded simply connected plane domains $\Omega\subset\mathbb{C}$ using conformal transformations of the original problem to the weighted eigenvalue problem for the Dirichlet…

In this paper, we use graph theory to solve wave scattering problems in the discrete dipole approximation. As a key result of this work, in the presence of active scatterers, we present a systematic method to find arbitrary large-order zero…

$ \renewcommand{\subset}{\subseteq} \newcommand{\N}{\mathbb N} $For $p\in [2,\infty)$ the metric $X_p$ inequality with sharp scaling parameter is proven here to hold true in $L_p$. The geometric consequences of this result include the…