\texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams

DOI10.1007/978-3-030-81097-9_16zbMath1485.57001OpenAlexW3186782465MaRDI QIDQ2128824

Abdullah Khan, Alexei Vernitski, Alexej P. Lisitsa

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81097-9_16

Mathematics Subject Classification ID

Plane and space curves (14H50) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) Knot theory (57K10)

Related Items (2)

Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs ⋮ Gauss-lintel

Uses Software

• OEIS
• SWI-Prolog

Cites Work

• Unnamed Item
• Unnamed Item
• A classification of spherical curves based on Gauss diagrams
• On the realization of double occurrence words
• Virtual knot theory
• SWI-Prolog
• On realizabilty of Gauss diagrams and constructions of meanders
• A forbidden substructure characterization of Gauss codes
• Parity conditions for realizability of Gauss diagrams
• THE PLANARITY PROBLEM II
• On Burnside's Problem

This page was built for publication: \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams