Backman and Liu proved that every integral generalized permutohedron of type , and in particular every matroid base polytope, admits a regular unimodular triangulation. The analogous statement fails in type : the delta-matroid simplex has normalized volume and no lattice points other than its vertices, so it has no unimodular triangulation. We show moreover that, up to the natural symmetries of the cube and deletion of constant coordinates, it is the unique non-unimodular delta-matroid polytope that is a simplex. We prove instead that every delta-matroid polytope admits a regular dyadic triangulation, meaning a lattice triangulation whose maximal simplices have normalized volumes that are powers of two. More generally, every integral type generalized permutohedron admits such a triangulation. The main lattice-theoretic ingredient is that the type root configuration forms a totally dyadic system, a -local analogue of total unimodularity. As a consequence, these polytopes satisfy a dyadic version of the integer decomposition property. In each dimension the corresponding exponent can be chosen uniformly, even though ordinary integer decomposition can fail for delta-matroid polytopes.

生成讲解博客的中文版本

生成AI智能校验的中文版本