39 problems
A hyperbolic strictly-convex polyhedron is a strictly-convex polyhedron in hyperbolic space, with dihedral angles measured along its edges. Stoker's conjecture. Every hyperbolic st…
In the setting of Theorem, concerning robustness classes of convex solids and platonic solids, let downward external robustness and downward full robustness be the corresponding do…
Let be a compact, oriented, irreducible, atoroidal -manifold with boundary equipped with an angled block structure, and let denote its universal cover. The a…
Milnor's continuity and vanishing conjecture. The volume function admits a continuous extension to . Furthermore, the points on where va…
existence and zigzag conjecture. (i) A z-knotted exists if and only if and . (ii) A tight exists if and only if and…
Symmetry-group conjecture. (i) exists if and only if is even and ; there are no tight . (ii) exists if and only if…
Curvature-graph conjecture. The graph of curvatures of any tight graph of type is the graph in the first of those three cases.
Let be the stellated tetrahedron with vertices … … … … where edges join all and for , and . A polyhedron is Rupert if it…
Let be a polyhedron. It is Rupert if there exist and such that … where drops the…
Let be a convex polyhedron, meaning the convex hull of a finite set of points in in convex position. A polyhedron is Rupert if there exist…
Domokos–Horváth–Goriely–Regős conjecture. Every polyhedral tiling can be completely softened.
Finite-subcomplex relaxation conjecture. Condition (3) can be relaxed so that it is required to hold only outside a finite sub-complex of .
Let be any “polytope” with a full-dimensional affine span in . Let be placed anywhere in . Let be any stress for the bar fr…
Soft polyhedric realization conjecture. There exists a combinatorially equivalent, soft polyhedric tiling .
Let be a regular -sided polygon with , circumscribed by a circle of unit radius. For a positive even integer , let denote the corresponding…
A geometric polyhedron here may be nonconvex and self-intersecting; its faces, dihedral angles, edge lengths, and partially-flat vertices are understood in the sense of the paper.…
Asymptotic count conjecture. As , the counts and are respectively asymptotic to
Zero-condition conjecture. The conditions from the Clean Condition are satisfied only when .
Let and be polyhedra with the same -skeleton . Suppose that, for every edge of , the dihedral angles of and at the corresponding edge…
Let be a polyhedron and let be its dual. A polyhedron is locally Rupert if it has a local Rupert passage, and reverse locally Rupert if it has the corresponding reverse pas…
A polyhedron is locally Rupert if it admits a Rupert passage after an arbitrarily small alteration of a suitable orientation, and locally reverse Rupert is the analogous reverse-pa…
Polyhedron-bisecting curve conjecture. For each polyhedron in there exists a smooth simple closed curve such that
The Rhombicosidodecahedron is the point-symmetric Archimedean solid considered here, and Rupert's property means that a congruent copy can pass through a hole cut into the original…
A convex polyhedron is a polyhedron in whose faces are convex polygons. Such a polyhedron has Rupert's property if a hole can be cut into it through w…
Irreducible non-realizability conjecture. There is an irreducible SOD satisfying the axioms that is not the visibility map of any polyhedron with respec…