相关论文: On f-vectors of Minkowski additions of convex poly…

One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…

Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We…

In the literature, the Minkowski-sum and the metric-sum of compact sets are highlighted. While the first is associative, the latter is not. But the major drawback of the Minkowski combination is that, by increasing the number of summands,…

Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…

We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and…

In this paper we explore questions regarding the Minkowski sum of the boundaries of convex sets. Motivated by a question suggested to us by V.~Milman regarding the volume of $\partial K+ \partial T$ where $K$ and $T$ are convex bodies, we…

We consider polyhedra and 4-polytopes in Minkowski spacetime - in particular, null polyhedra with zero volume, and 4-polytopes that have such polyhedra as their hyperfaces. We present the basic properties of several classes of null-faced…

The famous Minkowski inequality provides a sharp lower bound for the mixed volume $V(K,M[n-1])$ of two convex bodies $K,M\subset\mathbb{R}^n$ in terms of powers of the volumes of the individual bodies $K$ and $M$. The special case where $K$…

We investigate the combinatorics of max-pooling layers, which are functions that downsample input arrays by taking the maximum over shifted windows of input coordinates, and which are commonly used in convolutional neural networks. We…

The faces of a convex set owe their relevance to an interplay between convexity and topology that is systematically studied in the work of Rockafellar. Infinite-dimensional convex sets are excluded from this theory as their relative…

We completely characterize the faces of the root polytope $\tilde Q_G = \text{conv}\{\mathbf 0, \mathbf e_i - \mathbf e_j\: (i,j) \in E(G)\}$ combinatorially. Our results specialize to state of the art results in a straightforward way.

We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…

We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…

The Brunn-Minkowski theory relies heavily on the notion of mixed volumes. Despite its particular importance, even explicit representations for the mixed volumes of two convex bodies in Euclidean space are available only in special cases.…

We prove a generalization of Hsiung-Minkowski formulas for closed submanifolds in semi-Riemannian manifolds with constant curvature. As a corollary, we obtain volume and area upper bounds for k-convex hypersurfaces in terms of a weighted…

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…

This paper was submitted to the Oberwolfach Conference "Combinatorial Convexity and Algebraic Geometry", October 1997. Let $M={\mathbb Z}^r$. For convex lattice polytopes $P,P'$ in ${\mathbb R}^r$, when is $(M \cap P)+ (M \cap P') = M \cap…

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

The space of Minkowski valuations on an m-dimensional complex vector space which are continuous, translation invariant and contravariant under the complex special linear group is explicitly described. Each valuation with these properties is…

We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…