The flag polynomial of the Minkowski sum of simplices

From MaRDI portal
Publication:368451

DOI10.1007/S00026-013-0189-2zbMATH Open1272.05005arXiv1006.5928OpenAlexW2068300765MaRDI QIDQ368451FDOQ368451

Geir Agnarsson

Publication date: 23 September 2013

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: For a polytope we define the {em flag polynomial}, a polynomial in commuting variables related to the well-known flag vector and describe how to express the the flag polynomial of the Minkowski sum of k standard simplices in a direct and canonical way in terms of the {em k-th master polytope} P(k) where kinats. The flag polynomial facilitates many direct computations. To demonstrate this we provide two examples; we first derive a formula for the f-polynomial and the maximum number of d-dimensional faces of the Minkowski sum of two simplices. We then compute the maximum discrepancy between the number of (0,d)-chains of faces of a Minkowski sum of two simplices and the number of such chains of faces of a simple polytope of the same dimension and on the same number of vertices.


Full work available at URL: https://arxiv.org/abs/1006.5928





Cites Work


Cited In (7)

Uses Software






This page was built for publication: The flag polynomial of the Minkowski sum of simplices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368451)