Rack shadows and their invariants
Wesley Chang, Sam Nelson

TL;DR
This paper introduces the concept of rack shadows, sets with rack actions, and demonstrates how shadow colorings of link diagrams can produce enhanced invariants that outperform traditional counting invariants.
Contribution
It defines rack shadows and develops enhanced invariants for classical links using shadow colorings, showing these are more powerful than unenhanced invariants.
Findings
Enhanced invariants are stronger than unenhanced counting invariants.
Shadow colorings provide a new method for link invariant enhancement.
The approach parallels vector space concepts over fields.
Abstract
A rack shadow is a set X with a rack action by a rack R, analogous to a vector space over a field. We use shadow colorings of classical link diagrams to define enhanced rack counting invariants and show that the enhanced invariants are stronger than unenhanced counting invariants.
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
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · Stochastic processes and statistical mechanics
