Related papers: Levinson's theorem for graphs II
Effective Hamiltonians can explain in a much simpler way the physics behind a scattering process. Chaotic scattering is directly related to Lorentzian Hamiltonians which, because of their properties, can be reduced to a $2\times 2$ matrix…
We consider the Vlasov-Poisson system with initial data a small, radial, absolutely continuous perturbation of a point charge. We show that the solution is global and disperses to infinity via a modified scattering along trajectories of the…
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,…
We calculate the S-matrix correlation function for chaotic scattering on quantum graphs and show that it agrees with that of random--matrix theory (RMT). We also calculate all higher S-matrix correlation functions in the Ericson regime.…
Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…
A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…
The matrix Schr\"odinger equation is considered on the half line with the general selfadjoint boundary condition at the origin described by two boundary matrices satisfying certain appropriate conditions. It is assumed that the matrix…
We present a new approach, based on graphon theory, to finding the limiting spectral distributions of general Wigner-type matrices. This approach determines the moments of the limiting measures and the equations of their Stieltjes…
Due to spectral obstructions, a scattering theory in the Lax-Phillips sense for the wave equation for differential p-forms on H^{n+1} cannot be developed. As a consequence, Huygens' principle for the wave equation in this context does not…
A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…
Using Schauder's theory for linear elliptic partial differential equations in two independent variables and fundamental estimates for univalent mappings due to E. Heinz we establish an upper bound of the Gaussian curvature of…
For integers $k\geq 1$ and $n\geq 2k+1$, the Schrijver graph $S(n,k)$ has as vertices all $k$-element subsets of $[n]:=\{1,2,\ldots,n\}$ that contain no two cyclically adjacent elements, and an edge between any two disjoint sets. More…
In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contrast to previous criteria, ours is based on only two…
We prove the discrete Lusternik-Schnirelmann theorem telling that tcat(G) less or equal to crit(G) for a general simple graph G=(V,E). It relates the minimal number tcat(G) of in G contractible graphs covering G, with crit(G), the minimal…
A scattering process can be described by suitably closing the system and considering the first return map from the entrance onto itself. This scattering map may be singular and discontinuous, but it will be measure preserving as a…
Bound and scattering states of a non-central extension of the three-dimensional Kepler-Coulomb Hamiltonian are worked out analytically within the framework of the potential groups of the problem, SO(7) for bound states and SO(6,1) for…
We prove that every properly edge-colored $n$-vertex graph with average degree at least $100(\log n)^2$ contains a rainbow cycle, improving upon $(\log n)^{2+o(1)}$ bound due to Tomon. We also prove that every properly colored $n$-vertex…
The Hamiltonian theory of zero-curvature equations with spectral parameter on an arbitrary compact Riemann surface is constructed. It is shown that the equations can be seen as commuting flows of an infinite-dimensional field generalization…
We prove the Simons-Johnson theorem for the sums $S_n$ of $m$-dependent random variables, with exponential weights and limiting compound Poisson distribution $\CP(s,\lambda)$. More precisely, we give sufficient conditions for…
We investigate the particle trapping and scattering properties in a tight-binding network which consists of several subgraphs. The particle trapping condition is proved under which particles can be trapped in a subgraph without leaking.…