Augmentations are sheaves for Legendrian graphs
نویسندگان
چکیده
In this article, associated to a (bordered) Legendrian graph, we study and show the equivalence between two categorical isotopy invariants: augmentation category, unital $A_{\infty}$-category, which lifts set of augmentations Chekanov-Eliashberg DGA, DG category constructible sheaves on front plane, with micro-support at contact infinity controlled by graph. other words, generalizing [21], prove are in singular case.
منابع مشابه
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.
متن کاملEdge-connectivity augmentations of bipartite graphs
Given a bipartite graph, the bipartite global edge-connectivity aug-mentation problem consists of finding a minimum cardinality edge setwhose addition results in a bipartite k-edge-connected graph. A min-imax theorem and some applications will be presented. This part ofthe talk is based on [1].I will also mention some preliminary results from [2] concerning thelocal ...
متن کامل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...
متن کامل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.
متن کاملFlow-cut Dualities for Sheaves on Graphs
This paper generalizes the Max-Flow Min-Cut (MFMC) theorem from the setting of numerical capacities to cellular sheaves of semimodules on directed graphs. Motivating examples of semimodules include probability distributions, multicommodity capacity constraints, and logical propositions. Directed algebraic topology provides the tools necessary for capturing the salient information in such a gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symplectic Geometry
سال: 2022
ISSN: ['1527-5256', '1540-2347']
DOI: https://doi.org/10.4310/jsg.2022.v20.n2.a1