English
Related papers

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

200 papers

We generalize the Strichartz estimates for Schr\"odinger operators on compact manifolds of Burq, G\'erard and Tzvetkov [10] by allowing critically singular potentials $V$. Specifically, we show that their $1/p$--loss $L^p_tL^q_x(I\times…

Analysis of PDEs · Mathematics 2021-06-03 Xiaoqi Huang , Christopher D. Sogge

We consider the graph whose vertex set is a conjugacy class ${\mathcal C}$ consisting of finite-rank self-adjoint operators on a complex Hilbert space $H$. The dimension of $H$ is assumed to be not less than $3$. In the case when operators…

Combinatorics · Mathematics 2021-11-05 Mark Pankov , Krzysztof Petelczyc , Mariusz Zynel

We prove a new criterion that guarantees self-adjointness of Toeplitz operator with unbounded operator-valued symbols. Our criterion applies, in particular, to symbols with Lipschitz continuous derivatives, which is the natural class of…

Mathematical Physics · Physics 2023-05-15 Wolfram Bauer , Lauritz van Luijk , Alexander Stottmeister , Reinhard F. Werner

We study the Lov\'asz-Schrijver lift-and-project operator ($LS_+$) based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of graphs. The problem of obtaining a combinatorial…

Discrete Mathematics · Computer Science 2014-11-11 S. Bianchi , M. Escalante , G. Nasini , L. Tunçel

We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree…

Combinatorics · Mathematics 2018-11-12 Padraig Condon , Jaehoon Kim , Daniela Kühn , Deryk Osthus

In this notes unbounded regular operators on Hilbert $C^*$-modules over arbitrary $C^*$-algebras are discussed. A densely defined operator $t$ possesses an adjoint operator if the graph of $t$ is an orthogonal summand. Moreover, for a…

Operator Algebras · Mathematics 2025-04-29 Michael Frank , Kamran Sharifi

The Erd\H{o}s-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erd\H{o}s-Simonovits type stability theorem in multi-partite graphs. Different from the Erd\H{o}s-Simonovits stability…

Combinatorics · Mathematics 2026-01-14 Wanfang Chen , Changhong Lu , Long-Tu Yuan

We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \in…

Combinatorics · Mathematics 2025-07-08 Peter Allen , Julia Böttcher , Yoshiharu Kohayakawa , Mihir Neve

We prove that the semi-classical Schrodinger operator with growing potential on a complete Riemannian manifold satisfies the Weyl law.

Spectral Theory · Mathematics 2025-05-20 Maxim Braverman

We prove a Landis type unique continuation result for positive quasi-linear operators on graphs. Specifically, we give decay criteria that ensures when a harmonic function for a positive quasilinear Schr\"odinger operator with potential…

Analysis of PDEs · Mathematics 2025-09-26 Ujjal Das , Matthias Keller , Yehuda Pinchover

K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…

Combinatorics · Mathematics 2024-02-01 Ryuhei Mizutani

We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…

Data Structures and Algorithms · Computer Science 2021-03-17 Farzam Ebrahimnejad , Ansh Nagda , Shayan Oveis Gharan

We consider Schr\"odinger operators on periodic discrete graphs. It is known that the spectrum of these operators has band structure. We obtain a localization of spectral bands in terms of eigenvalues of Dirichlet and Neumann operators on a…

Spectral Theory · Mathematics 2013-10-15 Evgeny Korotyaev , Natalia Saburova

A characterization of the essential spectrum $\sigma_{\text ess}$ of Schr\"odinger operators on infinite graphs is derived involving the concept of $\mathcal{R}$-limits. This concept, which was introduced previously for operators on…

Spectral Theory · Mathematics 2020-06-17 Siegfried Beckus , Latif Eliaz

The famous Conway--Gordon--Sachs theorem for the complete graph on six vertices was extended to the general complete graph on $n$ vertices by Kazakov--Korablev as a congruence modulo $2$, and its integral lift was given by…

Geometric Topology · Mathematics 2025-06-24 Ryo Nikkuni

We study the operator theory associated with such infinite graphs $G$ as occur in electrical networks, in fractals, in statistical mechanics, and even in internet search engines. Our emphasis is on the determination of spectral data for a…

Mathematical Physics · Physics 2009-11-13 Palle E. T. Jorgensen

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Dynamical Systems · Mathematics 2023-08-29 Anush Tserunyan

Nirenberg's famous complex Frobenius theorem gives necessary and sufficient conditions on a locally integrable structure for when the manifold is locally diffeomorphic to $\mathbb R^r\times\mathbb C^m\times \mathbb R^{N-r-2m}$ through a…

Complex Variables · Mathematics 2022-02-17 Liding Yao

A simple graph $G$ is \emph{overfull} if $|E(G)|>\Delta\lfloor|V(G)|/2\rfloor$. By the pigeonhole principle, every overfull graph $G$ has $\chi'(G)>\Delta$. The \emph{core} of a graph, denoted $G_\Delta$, is the subgraph induced by its…

Combinatorics · Mathematics 2019-11-18 Daniel W. Cranston , Landon Rabern

In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor…

Combinatorics · Mathematics 2018-09-27 Danial Dervovic