English
Related papers

Related papers: Optimization of the lowest eigenvalue for leaky st…

200 papers

We estimate the lowest eigenvalue in the gap of the essential spectrum of a Dirac operator with mass in terms of a Lebesgue norm of the potential. Such a bound is the counterpart for Dirac operators of the Keller estimates for the…

Analysis of PDEs · Mathematics 2023-07-25 Jean Dolbeault , David Gontier , Fabio Pizzichillo , Hanne Van Den Bosch

The celebrated Cheeger's Inequality \cite{am85,a86} establishes a bound on the expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the…

Discrete Mathematics · Computer Science 2014-10-31 Anand Louis

In this paper we determine the graph whose least eigenvalue of signless Laplacian attains the minimum or maximum among all connected non-bipartite graphs of fixed order and given number of pendant vertices. Thus we obtain a lower bound and…

Combinatorics · Mathematics 2014-09-19 Yi-Zheng Fan , Yi Wang , Huan Guo

We consider selfadjoint operators obtained by pasting a finite number of boundary relations with one-dimensional boundary space. A typical example of such an operator is the Schr\"odinger operator on a star-graph with a finite number of…

Spectral Theory · Mathematics 2023-10-17 Sergey Simonov , Harald Woracek

We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n,p) satisfies almost surely: \lambda_1(G)=(1+o(1))max{\sqrt{\Delta},np}, where \Delta is a maximal degree of G, and the o(1) term tends to…

Combinatorics · Mathematics 2007-05-23 Michael Krivelevich , Benny Sudakov

We analyze properties of semigroups generated by Schr\"odinger operators $-\Delta+V$ or polyharmonic operators $-(-\Delta)^m$, on metric graphs both on $L^p$-spaces and spaces of continuous functions. In the case of spatially constant…

Spectral Theory · Mathematics 2020-12-11 Simon Becker , Federica Gregorio , Delio Mugnolo

This paper lies in the context of the studies of eigenfunctions of graphs having minimum cardinality of support. One of the tools is the weight-distribution bound, a lower bound on the cardinality of support of an eigenfunction of a…

Combinatorics · Mathematics 2024-07-04 Sergey Goryainov , Dmitry Panasenko

Let $(\Sigma^2,ds^2)$ be a compact Riemannian surface, possibly with boundary, and consider Schr\"odinger-type operators of the form $L=\Delta+V-aK$ together with natural Robin and Steklov-type boundary conditions incorporating a boundary…

Differential Geometry · Mathematics 2026-01-28 Railane Antonia , Marcos P. Cavalcante , Vinicius Souza

Let $n$ be a positive integer and $m$ be a positive even integer. Let ${\mathcal A}$ be an $m^{th}$ order $n$-dimensional real weakly symmetric tensor and ${\mathcal B}$ be a real weakly symmetric positive definite tensor of the same size.…

Numerical Analysis · Mathematics 2016-01-15 Lixing Han

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

Spectral Theory · Mathematics 2013-08-27 Evans M. Harell , Joachim Stubbe

We study existence and stability properties of ground-state standing waves for two-dimensional nonlinear Schr\"odinger equation with a point interaction and a focusing power nonlinearity. The Schr\"odinger operator with a point interaction…

Analysis of PDEs · Mathematics 2021-09-13 Noriyoshi Fukaya , Vladimir Georgiev , Masahiro Ikeda

Convex optimization is the powerhouse behind the theory and practice of optimization. We introduce a quantum analogue of unconstrained convex optimization: computing the minimum eigenvalue of a Schr\"odinger operator $h = -\Delta + V $ with…

Quantum Physics · Physics 2025-11-10 Eunou Lee

We prove Lieb-Thirring inequalities for Schr\"odinger operators with a homogeneous magnetic field in two and three space dimensions. The inequalities bound sums of eigenvalues by a semi-classical approximation which depends on the strength…

Spectral Theory · Mathematics 2015-05-27 Rupert L. Frank , Rikard Olofsson

We are concerned with the dependence of the lowest positive eigenvalue of the Dirac operator on the geometry of rectangles, subject to infinite-mass boundary conditions. We conjecture that the square is a global minimiser both under the…

Spectral Theory · Mathematics 2022-08-22 Philippe Briet , David Krejcirik

We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…

Data Structures and Algorithms · Computer Science 2018-01-01 Charles Carlson , Alexandra Kolla , Nikhil Srivastava , Luca Trevisan

A $k$-fault-tolerant connectivity preserver of a directed $n$-vertex graph $G$ is a subgraph $H$ such that, for any edge set $F \subseteq E(G)$ of size $|F| \le k$, the strongly connected components of $G - F$ and $H - F$ are the same.…

Data Structures and Algorithms · Computer Science 2025-10-06 Gary Hoppenworth , Thatchaphol Saranurak , Benyu Wang

We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…

Combinatorics · Mathematics 2019-02-28 C. Dalfó , M. A. Fiol , J. Koolen

The author studies the inverse spectral problem of Sturm-Liouville operator on a star-like graph. To this star-like graph centered at the origin as its vertex, there are attached $m$ edges that imposed the Sturm-Liouville operator with…

Mathematical Physics · Physics 2025-06-30 Lung-Hui Chen

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…

Combinatorics · Mathematics 2007-11-14 Frank Vallentin

Perfect secret sharing scheme is a method of distribute a secret information $s$ among participants such that only predefined coalitions, called qualified subsets of the participants can recover the secret, whereas any other coalitions, the…

Cryptography and Security · Computer Science 2019-06-28 Mate Gyarmati , Peter Ligeti
‹ Prev 1 8 9 10 Next ›