2006
DOI: 10.2140/pjm.2006.224.141
|View full text |Cite
|
Sign up to set email alerts
|

The correspondence between augmentations and rulings for Legendrian knots

Abstract: We strengthen the link between holomorphic and generating-function 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0

Year Published

2006
2006
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(31 citation statements)
references
References 9 publications
0
31
0
Order By: Relevance
“…The knot contact homology describes knot invariants as invariants of the Legendrian submanifolds in the contact manifold [26,[45][46][47][48][49][50][51][52][53][54][55]. In particular, the geometric set-up of the knot contact homology in [56,57] is similar to the topological A-model on T * M [20][21][22], and the string-theoretical interpretation of the knot contact homology has been recently studied in [17].…”
Section: Appendix B Knot Contact Homology and Augmentation Polynomialmentioning
confidence: 99%
“…The knot contact homology describes knot invariants as invariants of the Legendrian submanifolds in the contact manifold [26,[45][46][47][48][49][50][51][52][53][54][55]. In particular, the geometric set-up of the knot contact homology in [56,57] is similar to the topological A-model on T * M [20][21][22], and the string-theoretical interpretation of the knot contact homology has been recently studied in [17].…”
Section: Appendix B Knot Contact Homology and Augmentation Polynomialmentioning
confidence: 99%
“…Ng and Sabloff also worked out a surjective correspondence [19] that assigns a Z-graded ruling to each augmentation. In that correspondence, the size of the preimage of each Z-graded ruling ρ of the front diagram f is the number 2 In particular, the number of augmentations belonging to ρ depends on θ(ρ) and the diagram only.…”
Section: Rulingsmentioning
confidence: 99%
“…From the algorithmic construction of the map Ψ : Aug(D) → R 0 (D) in [16], Ψ(ǫ i ) is ρ for all 1 ≤ i ≤ m. From Theorem 7.3 of [10], P ǫ i (t) = P C i (t) holds. Consequently, we may use the chord path approach given in Section 2.3 to compute P ǫ i (t).…”
Section: The Main Resultsmentioning
confidence: 99%
“…Fuchs and Ishkanov [8] and, independently, Sabloff [18] prove the converse. Ng and Sabloff [16] further clarify the relationship between augmentations and graded normal rulings by proving that there exists an algorithmically defined many-to-one map Ψ : Aug(D) → R 0 (D). Josh Sabloff posed the following question to the second author, "Does Ψ(ǫ 1 ) = Ψ(ǫ 2 ) imply P ǫ 1 (t) = P ǫ 2 (t)?"…”
Section: Introductionmentioning
confidence: 98%