Related papers: Combinatorial Methods for Minkowski Tensors of Pol…
Tensors are fundamental in mathematics, computer science, and physics. Their study through algebraic geometry and representation theory has proved very fruitful in the context of algebraic complexity theory and quantum information. In…
We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…
We generalize the translation invariant tensor-valued Minkowski Functionals which are defined on two-dimensional flat space to the unit sphere. We apply them to level sets of random fields. The contours enclosing boundaries of level sets of…
We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by…
Statistics of the free volume available to individual particles have previously been studied for simple and complex fluids, granular matter, amorphous solids, and structural glasses. Minkowski tensors provide a set of shape measures that…
We derive tight expressions for the maximum number of $k$-faces, $0\le k\le d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex polytopes $P_1$, $P_2$ and $P_3$, as a function of the number of vertices of the…
We investigate the structure of the Minkowski sum of standard simplices in ${\reals}^r$. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope.
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex…
In this paper we settle long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of…
Intrinsic volumes and Minkowski tensors have been used to describe the geometry of real world objects. This paper presents an estimator that allows to approximate these quantities from digital images. It is based on a generalized Steiner…
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…
The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in…
We establish an additive kinematic formula for the functional Minkowski vectors using mixed Monge-Amp\`ere measures. These vectors, recently introduced and characterized by the author and F. Mussnig, form a natural family of vector-valued…
Using concepts from integral geometry, we propose a definition for a local coarse-grained curvature tensor that is well-defined on polygonal surfaces. This coarse-grained curvature tensor shows fast convergence to the curvature tensor of…
Realisations of associahedra with linearly non-isomorphic normal fans can be obtained by alteration of the right-hand sides of the facet-defining inequalities from a classical permutahedron. These polytopes can be expressed as Minkowski…
We give an introduction to the theory and to some applications of eigenvectors of tensors (in other words, invariant one-dimensional subspaces of homogeneous polynomial maps), including a review of some concepts that are useful for their…
Zonoids are Hausdorff limits of zonotopes, while zonotopes are convex polytopes defined as the Minkowski sums of finitely many segments. We present a combinatorial framework that links the study of mixed volumes of zonoids (a topic that has…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…