2000 character limit reached
Augmentations and ruling polynomials for Legendrian graphs (1911.11563v1)
Published 26 Nov 2019 in math.SG and math.GT
Abstract: In this article, associated to a (bordered) Legendrian graph, we study and show the equivalence between two Legendrian isotopy invariants: augmentation number via point-counting over a finite field, for the augmentation variety of the associated Chekanov-Eliashberg differential graded algebra, and ruling polynomial via combinatorics of the decompositions of the associated front projection.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.