The flag polynomial of the Minkowski sum of simplices

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

23 pages, 1 figure

Scientific paper

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 $k\in\nats$. 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The flag polynomial of the Minkowski sum of simplices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The flag polynomial of the Minkowski sum of simplices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The flag polynomial of the Minkowski sum of simplices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-154489

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.