Counting Tripods on the Torus
Abstract
Motivated by the problem of counting finite BPS webs, we count certain immersed metric graphs, tripods, on the flat torus. Classical Euclidean geometry turns this into a lattice point counting problem in C2, and we give an asymptotic counting result using lattice point counting techniques.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.