Related papers: Spectra of infinite graphs via Schur complement
Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…
We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…
Extending the corresponding notion for matrices or bounded linear operators on a Hilbert space we define a generalized Schur complement for a non-negative linear operator mapping a linear space into its dual and derive some of its…
The goal of this paper is to develop the theory of Schur complementation in the context of operators acting on anti-dual pairs. As a byproduct, we obtain a natural generalization of the parallel sum and parallel difference, as well as the…
We consider discrete Schr\"odinger operators with real periodic potentials on periodic graphs. The spectra of the operators consist of a finite number of bands. By "rolling up" a periodic graph along some appropriate directions we obtain…
A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…
We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…
The spectral properties of two-dimensional Schr\"odinger operators with $\delta'$-potentials supported on star graphs are discussed. We describe the essential spectrum and give a complete description of situations in which the discrete…
We use tools from free probability to study the spectra of Hermitian operators on infinite graphs. Special attention is devoted to universal covering trees of finite graphs. For operators on these graphs we derive a new variational formula…
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…
Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimodular graphs over finite fields and, more generally, over finite valuation rings. We compute the spectrum of the unimodular graphs, by using…
The study of the mapping class group of the plane minus a Cantor set uses a graph of loops, which is an analogous of the curve graph in the study of mapping class groups of compact surfaces. The Gromov boundary of this loop graph can be…
In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…
This paper has a twofold purpose: to present an overview of the theory of absolutely summing operators and its different generalizations for the multilinear setting, and to sketch the beginning of a research project related to an objective…
A graph is Schur-positive if its chromatic symmetric function expands non-negatively in the Schur basis. We determine a full Schur-positivity classification for complete multipartite graphs by showing that a complete multipartite graph…
The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on…
In this paper we study spectral properties of Schr\"odinger operators with quasi-periodic potentials related to quasi-periodic action minimizing trajectories for analytic twist maps. We prove that the spectrum contains a component of…
We describe the spectral theory of the adjacency operator of a graph which is isomorphic to homogeneous trees at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the…
The aim of this work is to study the Airy and Schr\"odinger operators on looping-edge graphs, a class of metric graphs consisting of a circle and a finite number $N$ of infinite half-lines attached to a common vertex. For the Airy operator,…
It is shown that there are groups $\Gamma$ with finite generating sets $S$ such that the adjacency operator of the Cayley graph ${\rm Cay}(\Gamma,S)$ is a disjoint union of $N$ intervals, for arbitrarily large integers $N$.