In this talk we associate a combinatorial dg-algebra to a cubic planar graph. This algebra is defined by counting binary sequences, which we introduce, and we shall provide explicit computations. From there, we study the Legendrian surfaces behind these combinatorial constructions, including Legendrian surgeries and the count of Morse flow trees, and discuss the proof of the correspondence between augmentations and constructible sheaves for this class of Legendrians.
- You are here:
- Home