Realization spaces of 4-polytopes are universal

Let $P\subset\R^d$ be a $d$-dimensional polytope. The {\em realization space} of~$P$ is the space of all polytopes $P'\subset\R^d$ that are combinatorially equivalent to~$P$, modulo affine transformations. We report on work by the first author, which shows that realization spaces of \mbox{4-dimensional} polytopes can be ``arbitrarily bad'': namely, for every primary semialgebraic set~$V$ defined over~$\Z$, there is a $4$-polytope $P(V)$ whose realization space is ``stably equivalent'' to~$V$. This implies that the realization space of a $4$-polytope can have the homotopy type of an arbitrary finite simplicial complex, and that all algebraic numbers are needed to realize all $4$- polytopes. The proof is constructive. These results sharply contrast the $3$-dimensional case, where realization spaces are contractible and all polytopes are realizable with integral coordinates (Steinitz's Theorem). No similar universality result was previously known in any fixed dimension.Comment: 10 page

Cayley-Bacharach Formulas

The Cayley-Bacharach Theorem states that all cubic curves through eight given points in the plane also pass through a unique ninth point. We write that point as an explicit rational function in the other eight.Comment: 13 pages, 4 figure

The Complexity of Finding Small Triangulations of Convex 3-Polytopes

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.Comment: 37 pages. An earlier version containing the sketch of the proof appeared at the proceedings of SODA 200

Every non-Euclidean oriented matroid admits a biquadratic final polynomial

Richter-Gebert proved that every non-Euclidean uniform oriented matroid admits a biquadratic final polynomial. We extend this result to the non-uniform cas

Extremal properties for dissections of convex 3-polytopes

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices forms a simplicial complex. The size of a dissection is the number of d-simplices it contains. This paper compares triangulations of maximal size with dissections of maximal size. We also exhibit lower and upper bounds for the size of dissections of a 3-polytope and analyze extremal size triangulations for specific non-simplicial polytopes: prisms, antiprisms, Archimedean solids, and combinatorial d-cubes.Comment: 19 page

Rank of divisors on tropical curves

We investigate, using purely combinatorial methods, structural and algorithmic properties of linear equivalence classes of divisors on tropical curves. In particular, an elementary proof of the Riemann-Roch theorem for tropical curves, similar to the recent proof of the Riemann-Roch theorem for graphs by Baker and Norine, is presented. In addition, a conjecture of Baker asserting that the rank of a divisor D on a (non-metric) graph is equal to the rank of D on the corresponding metric graph is confirmed, and an algorithm for computing the rank of a divisor on a tropical curve is constructed

Oriented Matroids -- Combinatorial Structures Underlying Loop Quantum Gravity

We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence vertices of a graph in 3-dimensional Riemannian space, and can be represented by sign strings containing relative orientations of embedded edges. We demonstrate that these signature factors are a special representation of the general mathematical concept of an oriented matroid. Moreover, we show that oriented matroids can also be used to describe the topology (connectedness) of directed graphs. Hence the mathematical methods developed for oriented matroids can be applied to the difficult combinatorics of embedded graphs underlying the construction of LQG. As a first application we revisit the analysis of [4-5], and find that enumeration of all possible sign configurations used there is equivalent to enumerating all realizable oriented matroids of rank 3, and thus can be greatly simplified. We find that for 7-valent vertices having no coplanar triples of edge tangents, the smallest non-zero eigenvalue of the volume spectrum does not grow as one increases the maximum spin \jmax at the vertex, for any orientation of the edge tangents. This indicates that, in contrast to the area operator, considering large \jmax does not necessarily imply large volume eigenvalues. In addition we give an outlook to possible starting points for rewriting the combinatorics of LQG in terms of oriented matroids.Comment: 43 pages, 26 figures, LaTeX. Version published in CQG. Typos corrected, presentation slightly extende

Minimal external representations of tropical polyhedra

Tropical polyhedra are known to be representable externally, as intersections of finitely many tropical half-spaces. However, unlike in the classical case, the extreme rays of their polar cones provide external representations containing in general superfluous half-spaces. In this paper, we prove that any tropical polyhedral cone in R^n (also known as "tropical polytope" in the literature) admits an essentially unique minimal external representation. The result is obtained by establishing a (partial) anti-exchange property of half-spaces. Moreover, we show that the apices of the half-spaces appearing in such non-redundant external representations are vertices of the cell complex associated with the polyhedral cone. We also establish a necessary condition for a vertex of this cell complex to be the apex of a non-redundant half-space. It is shown that this condition is sufficient for a dense class of polyhedral cones having "generic extremities".Comment: v1: 32 pages, 10 figures; v2: minor revision, 34 pages, 10 figure