MathDBThe Sierpinski Tetrahedron universality conjecture for knots
The Sierpinski Tetrahedron universality conjecture for knots
Let be a knot, and let the Sierpinski Tetrahedron denote the fractal obtained by the iterative construction described in the paper. A finite iteration is one of the finite-stage approximations in this construction. Sierpinski Tetrahedron universality conjecture. Every knot can be embedded into the Sierpinski Tetrahedron.
Sources & referencesView supporting material
Primary source
Joshua Broden, Malors Espinosa, Noah Nazareth and Niko Voth, “Knots Inside Fractals”, arXiv:2409.03639 (2024).
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
Sign in to submit a solution.
No solutions have been posted yet.