Related papers: Slicing and dicing polytopes
This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric…
The classical Minkowski problem for convex bodies has deeply influenced the development of differential geometry. During the past several decades, abundant mathematical theories have been developed for studying the solutions of the…
One can iteratively obtain a free resolution of any monomial ideal $I$ by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takayama have shown that this procedure yields a minimal…
We extend the concept of genuine rigidity of submanifolds by allowing mild singularities, mainly to obtain new global rigidity results and unify the known ones. As one of the consequences, we simultaneously extend and unify Sacksteder and…
The shellability of the boundary complex of an unbounded polyhedron is investigated. To this end, it is necessary to pass to a suitable compactification, e.g., by one point. This observation can be exploited to prove that any tropical…
Existence of solution of the logarithmic Minkowski problem is proved for the case where the discrete measures on the unit sphere satisfy the subspace concentration condition with respect to some special proper subspaces. In order to…
A number of regularization methods for discrete inverse problems consist in considering weighted versions of the usual least square solution. However, these so-called filter methods are generally restricted to monotonic transformations,…
The mixing operation for abstract polytopes gives a natural way to construct the minimal common cover of two polytopes. In this paper, we apply this construction to the regular convex polytopes, determining when the mix is again a polytope,…
For a natural class of $r \times n$ integer matrices, we construct a non-convex polytope which periodically tiles $\mathbb R^n$. From this tiling, we provide a family of geometrically meaningful maps from a generalized sandpile group to a…
To determine the relative position of any two surfaces in a system, one approach is to useoperations (Minkowski sum and intersection) on sets of constraints. These constraints aremade compliant with half-spaces of R^n where each set of…
We show that: (1) unimodular simplices in a lattice 3-polytope cover a neighborhood of the boundary of the polytope if and only if the polytope is very ample, (2) the convex hull of lattice points in every ellipsoid in R^3 has a unimodular…
The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…
We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…
We introduce tame sc-Fredholm sections and slices of sc-Fredholm sections. A slice is a notion of subpolyfold that is compatible with the sc-Fredholm section and has finite locally constant codimension. We prove that the subspace of a tame…
We study the Dirichlet problem for Monge-Amp\`ere equation in bounded convex polytopes. We give sharp conditions for the existence of global $C^2$ and $C^{2,\alpha}$ convex solutions provided that a global $C^2$, convex subsolution exists.
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…
We introduce a perfect discrete Morse function on the moduli space of a polygonal linkage. The ingredients of the construction are: (1) the cell structure on the moduli space, and (2) the discrete Morse theory approach, which allows to…
The aim of this note is to give a quick algebraic proof of (the combinatorial part of) the classification theorem for compact real surfaces, whose classical proofs (as in the Massey book and in the Conway ZIP proof) are based on surgery…
In the case of smooth manifolds, we use Forman's discrete Morse theory to realize combinatorially any Thom-Smale complex coming from a smooth Morse function by a couple triangulation-discrete Morse function. As an application, we prove that…