Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cyclic coverings of virtual link diagrams

Published 8 Mar 2019 in math.GT | (1903.03306v1)

Abstract: A virtual link diagram is called mod $m$ almost classical if it admits an Alexander numbering valued in integers modulo $m$, and a virtual link is called mod $m$ almost classical if it has a mod $m$ almost classical diagram as a representative. In this paper, we introduce a method of constructing a mod $m$ almost classical virtual link diagram from a given virtual link diagram, which we call an $m$-fold cyclic covering diagram. The main result is that $m$-fold cyclic covering diagrams obtained from two equivalent virtual link diagrams are equivalent. Thus we have a well-defined map from the set of virtual links to the set of mod $m$ almost classical virtual links. Some applications are also given.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.