An Invariant of Virtual Trivalent Spatial Graphs
Evan Carr, Nancy Scherich, Sherilyn Tamagawa
TL;DR
The paper introduces a virtual Niebrzydowski algebra to color the planar complements of virtual $Y$-oriented trivalent spatial graphs, yielding an integer-valued invariant under virtual $Y$-oriented Reidemeister moves. It synthesizes virtual tribrackets with Niebrzydowski algebras, provides a corrected, fully defined set of axioms, and proves the main invariance result (Theorem 3.6) for colorings. It also develops a practical framework for partially defined products, solves welldefinedness issues with a new axiom, and supplies extensive computational data and data sets (Latin squares/cubes, truncated algebras) to support implementation and further study. The computational results reveal the landscape of small-order structures, highlight uniqueness phenomena at low orders, and raise intriguing open questions about higher-order algebras and partial-product patterns, with implications for knot and graph invariants in low-dimensional topology.
Abstract
We create an invariant of virtual Y-oriented trivalent spatial graphs using colorings by virtual Niebrzydowski algebras. This paper generalizes the color invariants using virtual tribrackets and Niebrzydowski algebras by Nelson and Pico, and Graves, Nelson, and the second author. We provide usable data sets of Latin Cubes and virtual Niebrzydowski algebras for computational implementation.
