Polytopal realizations of spherical subword complex dual graphs
Establish whether the dual graphs of spherical subword complexes admit realizations as the 1-skeletons of convex polytopes by constructing such polytopal realizations or proving that no such realization exists.
References
Further, there are dual graphs of spherical subword complexes which are conjectured to be realizable as a polytope, but no such realization is known.
— Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
(2602.22874 - Dorfer, 26 Feb 2026) in Section 2, The Associahedron and its generalizations