Soft polyhedric realization conjecture for balanced normal convex tilings
Soft polyhedric realization conjecture for balanced normal convex tilings
Let be a balanced, normal, convex tiling.
Soft polyhedric realization conjecture. There exists a combinatorially equivalent, soft polyhedric tiling .
Theorem 1 proves this conclusion under the stronger assumption that every dual of a vertex polyhedron in has a Hamiltonian circuit. The source suggests that this sufficient condition may be relaxable, but does not establish the conjecture in general.
Sources & referencesView supporting material
Primary source
Gábor Domokos, Alain Goriely, Ákos G. Horváth and Krisztina Regős, “Soft cells and the geometry of seashells”, arXiv:2402.04190 (2024).
Progress summary
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.