English
Related papers

Related papers: Levinson's theorem for graphs II

200 papers

Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.

Spectral Theory · Mathematics 2007-09-11 Gabor Elek

We investigate numerically the scattering of waves on discrete graphs. An efficient algorithm is developed to compute the reflection and transmission (spectral) coefficients. We then explore various configurations of input and output leads,…

Mathematical Physics · Physics 2025-08-29 Moysey Brio , Jean-Guy Caputo

In this article we continue our investigations of one particle quantum scattering theory for Schroedinger operators on a set of connected (idealized one-dimensional) wires forming a graph with an arbitrary number of open ends. The…

Quantum Physics · Physics 2015-06-26 Vadim Kostrykin , Robert Schrader

We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the S-matrix for all energies in any given open set…

Mathematical Physics · Physics 2023-11-28 Kazunori Ando , Hiroshi Isozaki , Evgeny Korotyaev , Hisashi Morioka

It has been shown that, in the infinite length limit, the magnons of the gauge theory spin chain can form bound states carrying one finite and one strictly infinite R-charge. These bound states have been argued to be associated to simple…

High Energy Physics - Theory · Physics 2010-10-27 Radu Roiban

Levinson's theorem for the one-dimensional Schr\"{o}dinger equation with a symmetric potential, which decays at infinity faster than $x^{-2}$, is established by the Sturm-Liouville theorem. The critical case, where the Schr\"{o}dinger…

Quantum Physics · Physics 2009-10-31 Shi-Hai Dong , Zhong-Qi Ma

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

Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…

Mathematical Physics · Physics 2011-10-06 Ondřej Turek , Taksu Cheon

In this paper, we first present spectral conditions for the existence of $C_{n-1}$ in graphs (2-connected graphs) of order $n$, which are motivated by a conjecture of Erd\H{o}s. Then we prove spectral conditions for the existence of…

Combinatorics · Mathematics 2025-10-21 Jun Ge , Bo Ning

Stein proved that for each simple plane triangulation H there exists a partitioning of the vertex of H into two subsets each of which induces a forest if and only if the dual H^{*} has a Hamilton cycle. We extend the Stein theorem for…

Combinatorics · Mathematics 2023-09-22 Jan Florek

We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…

Combinatorics · Mathematics 2017-12-13 João Paulo Costalonga

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…

Group Theory · Mathematics 2018-07-31 Daniel J. Woodhouse

The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…

Mesoscale and Nanoscale Physics · Physics 2015-06-25 L. Chekhov

We construct a scattering theory for harmonic one-forms on Riemann surfaces, obtained from boundary value problems involving systems of curves and the jump problem. We obtain an explicit expression for the scattering matrix in terms of…

Differential Geometry · Mathematics 2025-06-11 Eric Schippers , Wolfgang Staubach

Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…

Mathematical Physics · Physics 2016-01-19 Ram Band , Adam Sawicki , Uzy Smilansky

For any $n\geq4$ even, we establish a complete scattering theory for the linear wave equation on the $(n+1)$-dimensional de Sitter space. We prove the existence and uniqueness of scattering states, and asymptotic completeness. Moreover, we…

General Relativity and Quantum Cosmology · Physics 2024-05-10 Serban Cicortas

We consider dissipative Schroedinger operators of the form $H=-\Delta+V(x)$ on $L^2(\mathbb R^3)$, with $V(x)$ a complex, bounded and decaying potential with a non-positive imaginary part. We prove a topological version of Levinson's…

Mathematical Physics · Physics 2025-09-18 A. Alexander , J. Faupin , S. Richard

This paper analyzes the scattering theory for periodic tight-binding Hamiltonians perturbed by a finite range impurity. The classical energy gradient flow is used to construct a conjugate (or dilation) operator to the unperturbed…

Mathematical Physics · Physics 2016-10-28 Jean Bellissard , Hermann Schulz-Baldes

We study scattering rigidity for Hamiltonian systems on $T^*M\setminus 0$, where $M$ is a manifold with boundary equipped with a positively homogeneous Hamiltonian function $H(x,\xi)$. We show that $H$ can be uniquely determined by the…

Differential Geometry · Mathematics 2026-03-10 Nikolas Eptaminitakis , Plamen Stefanov

We give a common matroidal generalisation of `A Cantor-Bernstein theorem for paths in graphs' by Diestel and Thomassen and `A Cantor-Bernstein-type theorem for spanning trees in infinite graphs' by ourselves.

Combinatorics · Mathematics 2022-05-10 Attila Joó