2023/09/10 by Ivan Dynnikov, Dynnikov, Ivan, Maxim Prasolov +1 · 1 citation
Computer Science · Mathematics · #57K10 #57K33 #Advanced Combinatorial Mathematics #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2309.05087
openalex publication_date 2023/09/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of the link is small and explicitly known, the most time-consuming part of the algorithm can be bypassed, thus allowing one to compare many pairs of Legendrian and transverse links in practice.