The Hilbert Polynomial of Quandles and Colorings of Random Links

Abstract

Given a finite quandle Q, we study the average number of Q-colorings of the closure of a random braid in Bn as n varies. In particular we show that this number coincides with some polynomial PQ∈ Q[x] for n 0. The degree of this polynomial is readily computed in terms of Q as a quandle and these invariants are computed for all quandles with |Q| 4. Additionally we show that the methods in this paper allow to improve on the stability results of arXiv:0912.0325 from "periodic stability" to "stability".

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…