On Smooth Combinatorial Products of Simplices
Juliana Curtis, Tuong Le, Chayim Lowen
Abstract
We show that every lattice weak Minkowski summand of a smooth polytope combinatorially isomorphic to a product of simplices has a quadratic triangulation. This is achieved by identifying this class of polytopes with the class of Nakajima polytopes. We combine these results to give a new proof that two lattice weak Minkowski summands of the same such smooth polytope are relatively IDP. Along the way, we prove a structure theorem for simple polytopes whose 2-faces are triangles and trapezoids.
Create a lesson
Related papers
A Polytopal Realization of Higher-Categorical Associahedra
Spencer Backman, Nathaniel Bottman, Daria Poliakova
An infinite family of intransitive directed strongly regular graphs with rank 6 Weisfeiler--Leman closure
Štefan Gyürki
Maximizing the number of cliques in Kr+1-free graphs with forbidden properties
Aleyah Dawkins, Rachel Kirsch
Characterization of tree-child networks in terms of mu vectors
Toni Fuentes, Vincent Moulton, Katharina T. Huber et al.
Extremal subtrees of critical beta-splitting trees
Anna Brandenberger, Byron Chin, Elchanan Mossel
Castelnuovo-Mumford regularity of skew-symmetric matrix Schubert varieties
Jack Chen-An Chou