A note on Fox colorings of virtual tangles
Abstract
We study Fox colorings of tangle diagrams by R=Z or Z/pZ, where p≥3 is an odd integer. For an R-colored m-string tangle diagram, the colors at the 2m boundary points form a vector v∈ R2m. We show that for classical tangle diagrams, such vectors are completely characterized by the alternating sum condition (v)=0. We then investigate how this restriction changes in the virtual setting. For R=Z, the realizability of v is determined by a divisibility condition on (v). For R=Z/pZ, every vector is realizable by a virtual tangle diagram.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.