2022
DOI: 10.4007/annals.2022.195.1.3
|View full text |Cite
|
Sign up to set email alerts
|

Infinitely many Lagrangian fillings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
40
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 16 publications
(53 citation statements)
references
References 0 publications
1
40
0
Order By: Relevance
“…By Proposition 2.2, A(f ) is a well-defined invariant of the complex topological singularity. For these Legendrian links Λ = Λ f , the Couture-Perron algorithm [29] implies that there exist a Legendrian front π(Λ f ) ⊆ R 2 given by the (−1)-closure of a positive braid β∆ 2 , where ∆ is the full twist; equivalently the front is the rainbow closure of the positive braid β [20]. Hence, there is a set of non-negatively graded Reeb chords generating the DGA A (Λ f ) and ob(Aug + (Λ f )) coincides with the set of k-valued augmentations of A (Λ f ) where exactly one base point per component has been chosen, k a field.…”
Section: Augmentation Stack and The Cluster Algebra Ofmentioning
confidence: 99%
See 4 more Smart Citations
“…By Proposition 2.2, A(f ) is a well-defined invariant of the complex topological singularity. For these Legendrian links Λ = Λ f , the Couture-Perron algorithm [29] implies that there exist a Legendrian front π(Λ f ) ⊆ R 2 given by the (−1)-closure of a positive braid β∆ 2 , where ∆ is the full twist; equivalently the front is the rainbow closure of the positive braid β [20]. Hence, there is a set of non-negatively graded Reeb chords generating the DGA A (Λ f ) and ob(Aug + (Λ f )) coincides with the set of k-valued augmentations of A (Λ f ) where exactly one base point per component has been chosen, k a field.…”
Section: Augmentation Stack and The Cluster Algebra Ofmentioning
confidence: 99%
“…Thanks to the computational techniques available for augmentation varieties, the moduli of objects ob(Aug + (Λ(f ))) is readily computable for (−1)-framed closures of positive braids as in Section 3 above, confer Computation 3.2. Similarly Θ(f ) could be computed directly, or by means of the isomorphism to the wrapped Fukaya category 20 of W (Λ f ).…”
Section: A Few Computations and Remarksmentioning
confidence: 99%
See 3 more Smart Citations