On tabulating virtual strings
classification
🧮 math.GT
keywords
virtualstringscrossingsdefinedcertainclosedcounter-examplecurve
read the original abstract
A virtual string can be defined as a closed curve on a surface modulo certain equivalence relations. Turaev defined several invariants of virtual strings which we use to produce a table of virtual strings up to 4 crossings. We discuss progress in extending the tabulation to 5 crossings. We also provide a counter-example to a statement of Kadokami.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.