Related papers: BPS spectra from BPS graphs

A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its vertices are bimodal. Bimodality is at the heart of…

Stable non-BPS states can be constructed and studied in a variety of contexts in string theory. Here we review some interesting constructions that arise from suspended and wrapped branes. We also exhibit some stable non-BPS states that have…

We report a scalable hybrid quantum-classical machine learning framework to build Bayesian networks (BN) that captures the conditional dependence and causal relationships of random variables. The generation of a BN consists of finding a…

BPS states in type II string compactified on a Calabi-Yau threefold can typically be decomposed as moduli-dependent bound states of absolutely stable constituents, with a hierarchical structure labelled by attractor flow trees. This…

We examine the low-lying quarter BPS spectrum of a 2d conformal field theory with target Sym$^N(K3)$ at various points in the moduli space, and look at a more refined count than the ordinary elliptic genus. We compute growth of the spectrum…

Gaussian Boson Sampling (GBS) is a quantum computational model that leverages linear optics to solve sampling problems believed to be classically intractable. Recent experimental breakthroughs have demonstrated quantum advantage using GBS,…

Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…

We consider the quantum UV-IR map for line defects in class $S$ theories of $\mathfrak{gl}(3)$-type. This map computes the protected spin character which counts framed BPS states with spin for the bulk-defect system. We give a geometric…

Network topology inference is a prominent problem in Network Science. Most graph signal processing (GSP) efforts to date assume that the underlying network is known, and then analyze how the graph's algebraic and spectral characteristics…

In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let $G$ be a graph and $G^m$ be the $m$-th power (hypergraph) of $G$. The spectrum of $G$ is referring to its adjacency…

This is the second part of the paper that provides a new strategy for the heterogeneous change detection (HCD) problem, that is, solving HCD from the perspective of graph signal processing (GSP). We construct a graph to represent the…

Associative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities:…

We discuss the generalization of recently discovered BPS configurations, corresponding to the planar string networks, to non-planar ones by considering the U-duality symmetry of type II string theory in various dimensions. As an explicit…

In this note we consider the set of line operators in theories of class $S$. We show that this set carries the action of a natural discrete dynamical system associated with the BPS spectrum. We discuss several applications of this…

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…

We analyze spectral properties of a quantum graph in the form of a ring chain with a $\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the…

A graph $G$ is said to be \textit{determined by its generalized spectrum} (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. In \cite{WX,WX1}, Wang and Xu gave…

We study junctions of supersymmetric domain walls in N=1 supergravity theories in four dimensions, coupled to a chiral superfield with quartic superpotential having $Z_3$ symmetry. After deriving a BPS equation of the domain wall junction,…

Switching is an operation on a graph that does not change the spectrum of the adjacency matrix, thus producing cospectral graphs. An important activity in the field of spectral graph theory is the characterization of graphs by their…

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…