Conjectured upper bound for the mosaic number of a knot

About 16 years old · traced to

Let KK be a knot with crossing number cc, and let nn be its mosaic number.

Mosaic-number upper-bound conjecture. The mosaic number satisfies

n≤c+2.n\leq c+2.

This conjecture is motivated by experimental evidence and proposes a sharper upper bound than the preceding general bound n≤4c+2n\leq 4c+2.

References

Primary source

J. Alan Alewine, H. A. Dye, David Etheridge, Irina Garduno and Amber Ramos, “Bounds on Mosaic Knots”, arXiv:1004.2214 (2010).

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.