English
Related papers

Related papers: A Glazman-Povzner-Wienholtz Theorem on graphs

200 papers

We consider a Schr\"odinger particle on a graph consisting of $\,N\,$ links joined at a single point. Each link supports a real locally integrable potential $\,V_j\,$; the self--adjointness is ensured by the $\,\delta\,$ type boundary…

funct-an · Mathematics 2009-10-28 Pavel Exner

We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schr\"odinger operators in a very general setting. We consider a sequence of finite graphs endowed with discrete Schr\"odinger operators, assumed to have a local…

Spectral Theory · Mathematics 2019-03-06 Nalini Anantharaman , Mostafa Sabri

An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…

Combinatorics · Mathematics 2020-06-17 E. Aigner-Horev , D. Conlon , H. Hàn , Y. Person , M. Schacht

We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…

Combinatorics · Mathematics 2023-06-21 Richard Lang , Nicolás Sanhueza-Matamala

The celebrated Hajnal-Szemer\'edi theorem gives the precise minimum degree threshold that forces a graph to contain a perfect K_k-packing. Fischer's conjecture states that the analogous result holds for all multipartite graphs except for…

Combinatorics · Mathematics 2015-09-15 Peter Keevash , Richard Mycroft

We consider the scattering theory for the Schr\"odinger operator $-\Dc_x^2+V(x)$ on graphs made of one-dimensional wires connected to external leads. We derive two expressions for the scattering matrix on arbitrary graphs. One involves…

Mesoscale and Nanoscale Physics · Physics 2009-11-07 Christophe Texier , Gilles Montambaux

This work studies geometrical characterizations of the essential spectrum $\sigma_{\text ess}$ of Schr\"odinger operators on graphs. Especially we focus on generalizing characterizations which are given in terms of the concept of right…

Spectral Theory · Mathematics 2019-09-24 Latif Eliaz

We consider boundary conditions at the vertex of a star graph which make Schroedinger operators on the graph self-adjoint, in particular, the two-parameter family of such conditions invariant with respect to permutations of graph edges. It…

Mathematical Physics · Physics 2007-05-23 Pavel Exner , Ondrej Turek

A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…

Combinatorics · Mathematics 2022-01-20 Atsushi Atsuji , Hiroshi Kaneko

We prove the completeness of the system of eigenfunctions of the complex Schr\"odinger operator $L=-d^2/dx^2+cx^{2/3}$ on the semiaxis in $L_2(0,+\infty)$ with Dirichlet boundary conditions for all $c$: $|\arg c|<\pi/2+\theta_0$, where…

Functional Analysis · Mathematics 2019-04-18 Sergey Tumanov

For a given subcritical discrete Schr\"odinger operator $H$ on a weighted infinite graph $X$, we construct a Hardy-weight $w$ which is optimal in the following sense. The operator $H - \lambda w$ is subcritical in $X$ for all $\lambda < 1$,…

Spectral Theory · Mathematics 2017-09-01 Matthias Keller , Yehuda Pinchover , Felix Pogorzelski

A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…

Combinatorics · Mathematics 2015-11-24 Jacob Fox , János Pach , Adam Sheffer , Andrew Suk , Joshua Zahl

To each graph on $n$ vertices there is an associated subspace of the $n \times n$ matrices called the operator system of the graph. We prove that two graphs are isomorphic if and only if their corresponding operator systems are unitally…

Operator Algebras · Mathematics 2014-12-23 Carlos M. Ortiz , Vern I. Paulsen

We prove sharp upper bounds for eigenvalues of Schr\"odinger operators on quantum graphs with $\delta$-coupling (also known as Robin) conditions at all vertices. The bounds depend on the geometry of the graph, on the potential, and the…

Spectral Theory · Mathematics 2025-05-21 Duc Hoang Cao

This is a short survey about the theory of stable polynomials and its applications. It gives self-contained proofs of two theorems of Schrijver. One of them asserts that for a $d$--regular bipartite graph $G$ on $2n$ vertices, the number of…

Combinatorics · Mathematics 2021-03-15 Péter Csikvári , Ádám Schweitzer

Let $W(G)$ be the Wiener index of a graph $G$. We say that a vertex $v \in V(G)$ is a \v{S}olt\'es vertex in $G$ if $W(G - v) = W(G)$, i.e. the Wiener index does not change if the vertex $v$ is removed. In 1991, \v{S}olt\'es posed the…

Combinatorics · Mathematics 2024-06-05 Nino Bašić , Martin Knor , Riste Škrekovski

This work is a continuation and extension of the note published in the Russian Math Surveys 1997 n 6. For any pair of solutions of the spectral problem for the second order selfadjoint real Schrodinger Operator on the graph their Symplectic…

Mathematical Physics · Physics 2007-05-23 S. P. Novikov

Random operators may acquire extended states formed from a multitude of mutually resonating local quasi-modes. This mechanics is explored here in the context of the random Schr\"odinger operator on the complete graph. The operators exhibits…

Mathematical Physics · Physics 2017-09-12 Michael Aizenman , Mira Shamis , Simone Warzel

We define the Schr\"odinger equation with focusing, cubic nonlinearity on one-vertex graphs. We prove global well-posedness in the energy domain and conservation laws for some self-adjoint boundary conditions at the vertex, i.e. Kirchhoff…

Mathematical Physics · Physics 2011-06-08 Riccardo Adami , Claudio Cacciapuoti , Domenico Finco , Diego Noja

The Perfect Graph Theorems are important results in graph theory describing the relationship between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph $G$. A graph $G$ is called \emph{perfect} if $\chi(H)=\omega(H)$ for…

Logic in Computer Science · Computer Science 2019-12-06 Abhishek Kr Singh , Raja Natarajan