
TL;DR
This paper introduces a combinatorial approach to classifying Legendrian graphs using rectangular diagrams and establishes a one-to-one correspondence with fence diagrams, simplifying their study.
Contribution
It develops a new combinatorial model for Legendrian graphs and proves their classification aligns with fence diagrams, advancing understanding in contact topology.
Findings
Rectangular diagrams represent Legendrian graphs combinatorially.
Equivalence of Legendrian graphs corresponds to rectangular diagram moves.
Legendrian graph classes are in one-to-one correspondence with fence diagrams.
Abstract
In this paper Legendrian graphs in are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendrian graphs and rectangular diagrams coincide. Using this result we prove that the classes of Legendrian graphs are in one-to-one correspondence with fence diagrams modulo fence moves introduced by Rudolph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
