A note on Fox colorings of virtual tangles
Takuji Nakamura, Yasutaka Nakanishi, Shin Satoh, Kodai Wada

TL;DR
This paper investigates Fox colorings of virtual tangles, revealing how boundary color vectors are characterized in classical cases and how these conditions change in virtual settings, especially over different rings.
Contribution
It provides a characterization of boundary color vectors for classical tangles and explores their realizability in virtual tangles over various rings.
Findings
Classical tangle boundary vectors satisfy an alternating sum condition.
In the virtual setting over integers, realizability depends on a divisibility condition.
Over rac{p}{}Z, all boundary vectors are realizable in virtual tangles.
Abstract
We study Fox colorings of tangle diagrams by or , where is an odd integer. For an -colored -string tangle diagram, the colors at the boundary points form a vector . We show that for classical tangle diagrams, such vectors are completely characterized by the alternating sum condition . We then investigate how this restriction changes in the virtual setting. For , the realizability of is determined by a divisibility condition on . For , every vector is realizable by a virtual tangle diagram.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Stochastic processes and statistical mechanics · Quasicrystal Structures and Properties
