The universal linear stick-number bound for knots

Let KK be a knot type, let c[K]c[K] denote its crossing number, and let stick[K]\operatorname{stick}[K] denote its stick number. Universal linear stick-number conjecture. Every knot with crossing number at least 1212 satisfies

stick[K]c[K].\operatorname{stick}[K]\leq c[K].

This is slightly stronger than the asymptotic conjecture β1\beta_*\leq 1. It is motivated by the authors' computations, including large random knots, for which they found embeddings using fewer sticks than the crossing number; no counterexample is known.

Sources & referencesView supporting material

Primary source

Jason Cantarella, Andrew Rechnitzer, Henrik Schumacher and Clayton Shonkwiler, “New Upper Bounds for Stick Numbers”, arXiv:2508.18263 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.