Open problems on \(k\)-orbit polytopes (Q1744750)

This paper contains a collection of 35 open problem on combinatorial, geometric, and algebraic aspects of \(k\)-orbit abstract polytopes. While not all of the questions collected here are new, the treatment here is accessible and provides a comprehensive description of questions that are important to the development of the theory of abstract polytopes beyond those that are regular or chiral, as well as citations of the essential works one would need to review to get started on any of these problems. A particularly useful element of the framing in this paper is the introduction of rooted \(n\)-polytopes, which is an ordered pair \((\mathcal P, \Phi)\) consisting of a polytope \(\mathcal P\) and a specified flag \(\Phi\) in \(\mathcal P\), which is the root of this ordered pair. The idea of rooted polytopes is one that has been hinted at and used elsewhere, if not stated formally or explicitly, but is formalized nicely here. Rooted polytopes provide a particularly nice framing when dealing with questions about \(k\)-orbit polytopes and the authors provide descriptions of rooted versions of the standard operations of mix and amalgamation of polytopes. The paper also includes: \begin{itemize} \item Bounds on the size of the monodromy or connection group of an abstract polytope in terms of the number of orbits of flags (Proposition 3.2). \item A proof that the mix of rooted polyhedra is polytopal (Theorem 3.8), generalizing Theorem 5.15 in [\textit{B. Monson} et al., Trans. Am. Math. Soc. 366, No. 5, 2651--2681 (2014; Zbl 1286.51014)] to rooted mixes. \item A proof of the existence of \(k\)-orbit polyhedra for each odd \(k\ge 5\) such that no section of rank 2 is a digon (Proposition 4.1). \end{itemize}