Webs and multiwebs for the symplectic group
Richard Kenyon, Haihan Wu

TL;DR
This paper introduces $2n$-multiwebs on planar graphs, explores their relation to $ ext{Sp}(2n)$-webs, and generalizes Kasteleyn's theorem to $2n$-multiweb covers, with classifications on simple surfaces.
Contribution
It defines $2n$-multiwebs, relates them to symplectic webs, and extends Kasteleyn's theorem to these structures on planar graphs.
Findings
Pfaffian of a matrix equals sum of traces of $2n$-multiwebs.
Generalization of Kasteleyn's theorem to $2n$-multiweb covers.
Classification of reduced $4$-webs and $2n$-webs on simple surfaces.
Abstract
We define -multiwebs on planar graphs and discuss their relation with -webs. On a planar graph with a symplectic local system we define a matrix whose Pfaffian is the sum of traces of -multiwebs. As application we generalize Kasteleyn's theorem from dimer covers to -multiweb covers of planar graphs with gauge group. For we relate Kuperberg's ``tetravalent vertex'' to the determinant, and classify reduced -webs on some simple surfaces: the annulus, torus, and pair of pants. We likewise define, for and , a -valent vertex corresponding to the determinant, and classify reduced -webs on an annulus.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Finite Group Theory Research · Homotopy and Cohomology in Algebraic Topology
