paper

A note on Fox colorings of virtual tangles

arXiv:2603.18392

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.

arXiv comment11 pages