7,955 research outputs found
Construction and Analysis of Projected Deformed Products
We introduce a deformed product construction for simple polytopes in terms of
lower-triangular block matrix representations. We further show how Gale duality
can be employed for the construction and for the analysis of deformed products
such that specified faces (e.g. all the k-faces) are ``strictly preserved''
under projection. Thus, starting from an arbitrary neighborly simplicial
(d-2)-polytope Q on n-1 vertices we construct a deformed n-cube, whose
projection to the last dcoordinates yields a neighborly cubical d-polytope. As
an extension of thecubical case, we construct matrix representations of
deformed products of(even) polygons (DPPs), which have a projection to d-space
that retains the complete (\lfloor \tfrac{d}{2} \rfloor - 1)-skeleton. In both
cases the combinatorial structure of the images under projection is completely
determined by the neighborly polytope Q: Our analysis provides explicit
combinatorial descriptions. This yields a multitude of combinatorially
different neighborly cubical polytopes and DPPs. As a special case, we obtain
simplified descriptions of the neighborly cubical polytopes of Joswig & Ziegler
(2000) as well as of the ``projected deformed products of polygons'' that were
announced by Ziegler (2004), a family of 4-polytopes whose ``fatness'' gets
arbitrarily close to 9.Comment: 20 pages, 5 figure
A note on lattice-face polytopes and their Ehrhart polynomials
We give a new definition of lattice-face polytopes by removing an unnecessary
restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and
show that with the new definition, the Ehrhart polynomial of a lattice-face
polytope still has the property that each coefficient is the normalized volume
of a projection of the original polytope. Furthermore, we show that the new
family of lattice-face polytopes contains all possible combinatorial types of
rational polytopes.Comment: 11 page
Experiences with enumeration of integer projections of parametric polytopes
Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enumerator of a parametric polytope) is a function of the symbolic parameters that may appear in the constraints. In an extended problem (the "integer projection" of a parametric polytope), some of the variables that appear in the constraints may be existentially quantified and then the enumerated set corresponds to the projection of the integer points in a parametric polytope.
This paper shows how to reduce the enumeration of the integer projection of parametric polytopes to the enumeration of parametric polytopes. Two approaches are described and experimentally compared. Both can solve problems that were considered very difficult to solve analytically
Prodsimplicial-Neighborly Polytopes
Simultaneously generalizing both neighborly and neighborly cubical polytopes,
we introduce PSN polytopes: their k-skeleton is combinatorially equivalent to
that of a product of r simplices. We construct PSN polytopes by three different
methods, the most versatile of which is an extension of Sanyal and Ziegler's
"projecting deformed products" construction to products of arbitrary simple
polytopes. For general r and k, the lowest dimension we achieve is 2k+r+1.
Using topological obstructions similar to those introduced by Sanyal to bound
the number of vertices of Minkowski sums, we show that this dimension is
minimal if we additionally require that the PSN polytope is obtained as a
projection of a polytope that is combinatorially equivalent to the product of r
simplices, when the dimensions of these simplices are all large compared to k.Comment: 28 pages, 9 figures; minor correction
Equality Set Projection: A new algorithm for the projection of polytopes in halfspace representation
In this paper we introduce a new algorithm called Equality Set Projection (ESP) for computing the orthogonal projection of bounded, convex polytopes. Our solution addresses the case where the input polytope is represented as the intersection of a finite number of halfplanes and its projection is given in an irredundant halfspace form. Unlike many existing approaches, the key advantage offered by ESP is its output sensitivity, i.e., its complexity is a function of the number of facets in the projection of the polytope. This feature makes it particularly suited for many problems of theoretical and practical importance in which the number of vertices far exceeds the number of facets. Further, it is shown that for non-degenerate polytopes of fixed size (dimension and number of facets) the complexity is linear in the number of facets in the projection. Numerical results are presented that demonstrate that high dimensional polytopes can be projected efficiently
Fiber polytopes for the projections between cyclic polytopes
The cyclic polytope is the convex hull of any points on the
moment curve in . For , we
consider the fiber polytope (in the sense of Billera and Sturmfels) associated
to the natural projection of cyclic polytopes which
"forgets" the last coordinates. It is known that this fiber polytope has
face lattice indexed by the coherent polytopal subdivisions of which
are induced by the map . Our main result characterizes the triples
for which the fiber polytope is canonical in either of the following
two senses:
- all polytopal subdivisions induced by are coherent,
- the structure of the fiber polytope does not depend upon the choice of
points on the moment curve.
We also discuss a new instance with a positive answer to the Generalized
Baues Problem, namely that of a projection where has only
regular subdivisions and has two more vertices than its dimension.Comment: 28 pages with 1 postscript figur
- …