Augmentations and ruling polynomials for Legendrian graphs
نویسندگان
چکیده
In this article, associated to a (bordered) Legendrian graph, we study and show the equivalence between two isotopy invariants: augmentation number via point-counting over finite field, for variety of Chekanov-Eliashberg differential graded algebra, ruling polynomial combinatorics decompositions front projection.
منابع مشابه
The Correspondence between Augmentations and Rulings for Legendrian Knots
We strengthen the link between holomorphic and generatingfunction invariants of Legendrian knots by establishing a formula relating the number of augmentations of a knot’s contact homology to the complete ruling invariant of Chekanov and Pushkar.
متن کاملGenerating function polynomials for legendrian links
It is shown that, in the 1{jet space of the circle, the swapping and the flyping procedures, which produce topologically equivalent links, can produce nonequivalent legendrian links. Each component of the links considered is legendrian isotopic to the 1{jet of the 0{function, and thus cannot be distinguished by the classical rotation number or Thurston{Bennequin invariants. The links are distin...
متن کاملPositivity of Legendrian Thom polynomials
We study Legendrian singularities arising in complex contact geometry. We define a one-parameter family of bases in the ring of Legendrian characteristic classes such that any Legendrian Thom polynomial has nonnegative coefficients when expanded in these bases. The method uses a suitable Lagrange Grassmann bundle on the product of projective spaces. This is an extension of a nonnegativity resul...
متن کاملLegendrian Graphs and Quasipositive Diagrams
In this paper we clarify the relationship between ribbon surfaces of Legendrian graphs and quasipositive diagrams by using certain fence diagrams. As an application, we give an alternative proof of a theorem concerning a relationship between quasipositive fiber surfaces and contact structures on S. We also answer a question of L. Rudolph concerning moves of quasipositive diagrams.
متن کاملEdge-Connectivity Augmentations of Graphs and Hypergraphs
A. Frank (Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math. 5(1), 22–53, 1992) developed a method to solve edgeconnectivity augmentation problems. His paper has stimulated further research in a number of directions, including many interesting generalizations. This paper surveys the current State of the Art on the edge-connectivity augmentation problem. Recent exte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic & Geometric Topology
سال: 2022
ISSN: ['1472-2739', '1472-2747']
DOI: https://doi.org/10.2140/agt.2022.22.2079