BPS Graphs: From Spectral Networks to BPS Quivers

We define "BPS graphs" on punctured Riemann surfaces associated with $A_{N-1}$ theories of class $\mathcal{S}$. BPS graphs provide a bridge between two powerful frameworks for studying the spectrum of BPS states: spectral networks and BPS quivers. They arise from degenerate spectral networks at maximal intersections of walls of marginal stability on the Coulomb branch. While the BPS spectrum is ill-defined at such intersections, a BPS graph captures a useful basis of elementary BPS states. The topology of a BPS graph encodes a BPS quiver, even for higher-rank theories and for theories with certain partial punctures. BPS graphs lead to a geometric realization of the combinatorics of Fock-Goncharov $N$-triangulations and generalize them in several ways.Comment: 48 pages, 44 figure

Stallings graphs for quasi-convex subgroups

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are canonically associated with the corresponding subgroups. We show that this notion of Stallings graphs allows a unified approach to many algorithmic problems: some which had already been solved like the generalized membership problem or the computation of a quasi-convexity constant (Kapovich, 1996); and others such as the computation of intersections, the conjugacy or the almost malnormality problems. Our results extend earlier algorithmic results for the more restricted class of virtually free groups. We also extend our construction to relatively quasi-convex subgroups of relatively hyperbolic groups, under certain additional conditions.Comment: 40 pages. New and improved versio