Related papers: Graph coverings and twisted operators
An arborescence of a directed graph $\Gamma$ is a spanning tree directed toward a particular vertex $v$. The arborescences of a graph rooted at a particular vertex may be encoded as a polynomial $A_v(\Gamma)$ representing the sum of the…
Given a weighted graph $G$ embedded in a non-orientable surface $\Sigma$, one can consider the corresponding weighted graph $\widetilde{G}$ embedded in the so-called orientation cover $\widetilde\Sigma$ of $\Sigma$. We prove identities…
This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering theory. For both problems, we characterize necessary and…
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…
A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…
The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…
Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…
Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed graphs, the notion of matching forest was proposed as a…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
Let $\Gamma$ be a generic subgroup of the multiplicative group $\mathbb{C}^*$ of nonzero complex numbers. We define a class of Lie algebras associated to $\Gamma$, called twisted $\Gamma$-Lie algebras, which is a natural generalization of…
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $t$-tessellability problem aims to decide whether there is a…
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
The representation of graphs is commonly based on the adjacency matrix concept. This formulation is the foundation of most algebraic and computational approaches to graph processing. The advent of deep learning language models offers a wide…
We establish a twisted analog of our recent work on vertex representations and the McKay correspondence. For each finite group $\Gamma$ and a virtual character of $\Gamma$ we construct twisted vertex operators on the Fock space spanned by…
We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…
Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
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…
We develop a general theory of "bisets": sets with two commuting group actions. They naturally encode topological correspondences. Just as van Kampen's theorem decomposes into a graph of groups the fundamental group of a space given with a…