English
Related papers

Related papers: Effect of edge-stretching on Steklov eigenvalues a…

200 papers

We study the first Steklov-Dirichlet eigenvalue on eccentric spherical shells in $\mathbb{R}^{n+2}$ with $n\geq 1$, imposing the Steklov condition on the outer boundary sphere, denoted by $\Gamma_S$, and the Dirichlet condition on the inner…

Analysis of PDEs · Mathematics 2026-02-02 Jiho Hong , Woojoo Lee , Mikyoung Lim

We show that for an Erd\H{o}s-R\'{e}nyi graph on $N$ vertices with expected degree $d$ satisfying $\log^{-1/9}N\leq d\leq \log^{1/40}N$, the largest eigenvalues can be precisely determined by small neighborhoods around vertices of close to…

Probability · Mathematics 2023-09-21 Ella Hiesmayr , Theo McKenzie

For integers $k$ and $\ell$, let $\operatorname{ind}(k, \ell)$ be the maximum proportion of $k$-vertex subsets of a large graph that induce exactly $\ell$ edges. The edge-statistics theorem (conjectured by Alon-Hefetz-Krivelevich-Tyomkyn,…

Combinatorics · Mathematics 2025-10-29 Alexandr Grebennikov , Matthew Kwan

Let $\Omega$ be an unbounded two dimensional strip on a ruled surface in $\mathbb{R}^d$, $d\geq2$. Consider the Laplacian operator in $\Omega$ with Dirichlet and Neumann boundary conditions on opposite sides of $\Omega$. We prove some…

Functional Analysis · Mathematics 2021-11-29 Rafael T. Amorim , Alessandra A. Verri

This paper is a brief account of the Steklov eigenvalue problem on a 2-dimensional rectangular domain, and then on a 3-dimensional rectangular box. It is divided into four sections. Section 1 relies heavily on real analytic methods to show…

Spectral Theory · Mathematics 2017-11-03 Arnold Tan

We study the eigenvalues of the unique connected anti-regular graph $A_n$. Using Chebyshev polynomials of the second kind, we obtain a trigonometric equation whose roots are the eigenvalues and perform elementary analysis to obtain an…

Combinatorics · Mathematics 2019-12-11 Cesar O. Aguilar , Joon-yeob Lee , Eric Piato , Barbara J. Schweitzer

We give results on optimal constants of isoperimetric inequalities involving Steklov eigenvalues on surfaces with boundary. We both consider this question on Riemannian surfaces with a same given topology or more specifically belonging to…

Differential Geometry · Mathematics 2025-08-15 Romain Petrides

We consider Steklov eigenvalues on nearly spherical and nearly annular domains in $d$ dimensions. By using the Green-Beltrami identity for spherical harmonic functions, the derivatives of Steklov eigenvalues with respect to the domain…

Spectral Theory · Mathematics 2023-10-31 Nathan Schroeder , Weaam Alhejaili , Chiu-Yen Kao

For a graph $G$, let $\lambda_2(G)$ denote the second largest eigenvalue of the adjacency matrix of $G$. We determine the extremal trees with maximum/minimum adjacency eigenvalue $\lambda_2$ in the class $\mathcal{T}(n,d)$ of $n$-vertex…

Combinatorics · Mathematics 2024-09-04 Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada , Hanmeng Zhan

We consider Steklov eigenvalues of nearly circular domains in $\R^{2}$ of fixed unitary area. In \cite{viator2018}, the authors treated such domains as perturbations of the disk, and they computed the first-order term of the asymptotic…

Analysis of PDEs · Mathematics 2025-05-01 Lucas Alland , Robert Viator

We consider the Steklov problem associated with the weighted p-Laplace operator and $(p,q)$-Laplacian on submanifolds with the boundary of Euclidean spaces and prove Reilly-type upper bounds for their first eigenvalues.

Differential Geometry · Mathematics 2022-04-21 Shahroud Azami

In tensor eigenvalue problems, one is likely to be more interested in H-eigenvalues of tensors. The largest H-eigenvalue of a nonnegative tensor or of a uniform hypergraph is the spectral radius of the tensor or of the uniform hypergraph.…

Numerical Analysis · Mathematics 2023-06-27 Hongying Lin , Lu Zheng , Bo Zhou

Let $G$ be a connected $d$-regular graph of order $n$, where $d\geq3$. Let $\lambda_{2}(G)$ be the second largest eigenvalue of $G$. For even $n$, we show that $G$ contains $\left\lfloor\frac{2}{3}(d-\lambda_{2}(G))\right\rfloor$…

Combinatorics · Mathematics 2024-10-08 Wenqian Zhang

This work deals with theoretical and numerical aspects related to the behavior of the Steklov-Lam\'e eigenvalues on variable domains. After establishing the eigenstructure for the disk, we prove that for a certain class of Lam\'e…

Optimization and Control · Mathematics 2022-05-24 Beniamin Bogosel , Pedro R. S. Antunes

Let $\lambda(G)$ be the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. Let $\lambda_{\rm e}(G)$ be the smallest number of edges that can be removed from…

Combinatorics · Mathematics 2020-07-24 Peter Borg

Given a compact Riemannian manifold (M, g) and two positive functions $\rho$ and $\sigma$, we are interested in the eigenvalues of the Dirichlet energy functional weighted by $\sigma$, with respect to the L 2 inner product weighted by…

Differential Geometry · Mathematics 2016-06-15 Bruno Colbois , Ahmad El Soufi

For graphs there exists a strong connection between spectral and combinatorial expansion properties. This is expressed, e.g., by the discrete Cheeger inequality, the lower bound of which states that $\lambda(G) \leq h(G)$, where…

Combinatorics · Mathematics 2015-01-12 Anna Gundert , May Szedlák

We prove two explicit bounds for the multiplicities of Steklov eigenvalues $\sigma_k$ on compact surfaces with boundary. One of the bounds depends only on the genus of a surface and the index $k$ of an eigenvalue, while the other depends as…

Differential Geometry · Mathematics 2013-11-26 Mikhail Karpukhin , Gerasim Kokarev , Iosif Polterovich

We present upper and lower bounds for Steklov eigenvalues for domains in $\mathbb{R}^{N+1}$ with $C^2$ boundary compatible with the Weyl asymptotics. In particular, we obtain sharp upper bounds on Riesz-means and the trace of corresponding…

Spectral Theory · Mathematics 2016-11-04 Luigi Provenzano , Joachim Stubbe

Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graphs. Wilf's inequality is stated as follows: $\frac{n}{n -…

Discrete Mathematics · Computer Science 2025-04-08 Hareshkumar Jadav , Sreekara Madyastha , Rahul Raut , Ranveer Singh