ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a convex 3-dimensional polytope. Two polytopes are combinatorially equivalent when they have the same combinatorial structure, and corresponding edges are edges identified by this equivalence. An edge-preserving symmetry is a symmetry preserving edge lengths.

Realization conjecture. For every convex 3-dimensional polytope PP, there exists a convex 3-dimensional polytope QQ combinatorially equivalent to PP such that the lengths of each pair of corresponding edges of PP and QQ are equal, and QQ realizes all its own edge-preserving symmetries.

The conjecture asks whether every combinatorial type and edge-length assignment of a convex 3-polytope admits a realization with all edge-preserving symmetries realized geometrically. The source presents it as a natural conjecture after showing that the sufficient inscribed-face condition is not necessary.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.