Virtual-knot problem 3 — The Flat Hierarchy
Statement
The Flat Hierarchy: The flat hierarchy is constructed for any ordinal . We label flat crossings with members of this ordinal. In a flat third Reidemeister move, a line with two labels can slide across a crossing labeled only if is greater than This generalizes the usual to theory of flat virtual diagrams to a system with arbitrarily many different types of flat crossings. Classify the diagrams in this hierarchy. This concept is due to Kauffman (unpublished). A first step in working with the flat hierarchy can be found in .
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.