Related papers: The Slack Realization Space of a Polytope
We show that the loop spaces of real projective spaces are topologically approximated by the spaces of rational maps from RP(1) to RP(n). As a byproduct of our constructions we obtain an interpretation of the Kronecker characteristic…
We formalize Pick's theorem for finding the area of a simple polygon whose vertices are integral lattice points. We are inspired by John Harrison's formalization of Pick's theorem in HOL Light, but tailor our proof approach to avoid a…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
We consider the vanishing ideal of an arrangement of linear subspaces in a vector space and investigate when this ideal can be generated by products of linear forms. We introduce a combinatorial construction (blocker duality) which yields…
The Jacobian ideal of a hyperplane arrangement is an ideal in the polynomial ring whose generators are the partial derivatives of the arrangements defining polynomial. In this article, we prove that an arrangement can be reconstructed from…
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of such an arrangement is completely determined by the oriented matroid. In this paper we study…
The free sum is a basic geometric operation among convex polytopes. This note focuses on the relationship between the normalized volume of the free sum and that of the summands. In particular, we show that the normalized volume of the free…
We consider complete intersection ideals in a polynomial ring over a field of characteristic zero that are stable under the action of the symmetric group permuting the variables. We determine the possible representation types for these…
Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial combinatory algebras (pcas). The morphisms inducing geometric morphisms (the {\em computationally dense\/} ones) are seen to be the ones…
We study finite-dimensional spaces of rational one-forms on a projective manifold by means of their integrable locus.
We study well-rounded lattices which come from ideals in quadratic number fields, generalizing some recent results of the first author with K. Petersen. In particular, we give a characterization of ideal well-rounded lattices in the plane…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…