Ruling invariants for Legendrian graphs
Byung Hee An, Youngjin Bae, Tam\'as K\'alm\'an

TL;DR
This paper introduces ruling invariants for Legendrian graphs, linking their existence to the augmentation of their DGA, and connects these invariants to established polynomial invariants and operations.
Contribution
It defines ruling invariants for Legendrian graphs, establishes their existence criteria via DGA augmentations, and relates them to known polynomial invariants and operations.
Findings
Rulings exist if and only if the DGA has an augmentation.
The ungraded ruling polynomial appears in the graph Kauffman polynomial for four-valent graphs.
Ruling invariants are compatible with vertex operations and diagram modifications.
Abstract
We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the first two authors, has an augmentation. We set up the usual ruling polynomials for various notions of gradedness and prove that if the graph is four-valent, then the ungraded ruling polynomial appears in Kauffman-Vogel's graph version of the Kauffman polynomial. Our ruling invariants are compatible with certain vertex-identifying operations as well as vertical cuts and gluings of front diagrams. We also show that Leverson's definition of a ruling of a Legendrian link in a connected sum of 's can be seen as a special case of ours.
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 Combinatorial Mathematics · Geometric and Algebraic Topology · Advanced Graph Theory Research
