Related papers: BPS Graphs: From Spectral Networks to BPS Quivers
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
Recently an exact duality between topological string and the spectral theory of operators constructed from mirror curves to toric Calabi-Yau threefolds has been proposed. At the same time an exact quantization condition for the cluster…
The Brouwer conjecture (BC) in spectral graph theory claims that the sum of the largest k Kirchhoff eigenvalues of a graph are bounded above by the number m of edges plus k(k+1)/2. We show that (BC) holds for all graphs with n vertices if n…
Tensor networks are generated by a set of small rank tensors and define many-body quantum states in a succinct form. The corresponding map is not one-to-one: different sets of tensors may generate the very same state. A fundamental question…
In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs representable by intersections of k-bend paths is denoted by…
Cluster coordinates for a large class of Argyres-Douglas and asymptotical free theories are constructed using network on bordered Riemann surface. Such N = 2 theories are engineered using six dimensional (2, 0) theory on Riemann surface…
The notion of graph covers is a discretization of covering spaces introduced and deeply studied in topology. In discrete mathematics and theoretical computer science, they have attained a lot of attention from both the structural and…
The BPS correlators of the symmetric product orbifold $\text{Sym}_N(\mathbb{T}^4)$ are reproduced from the dual worldsheet theory describing strings on $\text{AdS}_3\times {\rm S}^3\times \mathbb{T}^4$ with minimal ($k=1$) NS-NS flux. More…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An…
Quantum networks are often modelled using Schroedinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article…
Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in $\mathbb{R}^2$. We study a generalization in space: touching graphs of axis-aligned rectangles in $\mathbb{R}^3$, and prove that planar…
We consider a simple quiver gauge theory with gauge group U(r1) x U(r2) and a Higgs field in the bi-fundamental representation. The back-ground for this theory is a compact K\"ahler manifold M. For a careful but natural choice of Higgs…
We study the BPS spectrum and walls of marginal stability of the $\mathcal{N}=2$ supersymmetric theory in four dimensions with gauge group SU(n) and $n\le N_{f}<2n$ fundamental flavours at the root of the Higgs branch. The strong-coupling…
We apply and illustrate the techniques of spectral networks in a large collection of A_{K-1} theories of class S, which we call "lifted A_1 theories." Our construction makes contact with Fock and Goncharov's work on higher Teichmuller…
A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…
In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly…
With the advancements in technology and monitoring tools, we often encounter multivariate graph signals, which can be seen as the realizations of multivariate graph processes, and revealing the relationship between their constituent…