Related papers: Combinatorial Methods for Minkowski Tensors of Pol…

A symmetric tensor is called copositive if it generates a multivariate form taking nonnegative values over the nonnegative orthant. Copositive tensors have found important applications in polynomial optimization and tensor complementarity…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

The local Minkowski tensors are valuations on the space of convex bodies in Euclidean space with values in a space of tensor measures. They generalize at the same time the intrinsic volumes, the curvature measures and the isometry covariant…

This is an expository paper which has two parts. In the first part, we study quiver varieties of affine $A$-type from a combinatorial point of view. We present a combinatorial method for obtaining a closed formula for the generating…

By a tensor we mean a multidimensional array (matrix) or hypermatrix over a number field. This article aims to set an account of the studies on the permanent functions of tensors. We formulate the definitions of 1-permanent, 2-permanent,…

Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…

\emph{Minkowski rings} are certain rings of simple functions on the Euclidean space $W = {\mathbb{R}}^d$ with multiplicative structure derived from Minkowski addition of convex polytopes. When the ring is (finitely) generated by a set…

We develop certain combinatorial tools for the study of discriminants of general systems of polynomial equations. Applying these tools in a sequel paper, we completely classify components of such discriminants, generalizing the classical…

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…

We define combinatorial analogues of stable and unstable minimal surfaces in the setting of weighted pseudomanifolds. We prove that, under mild conditions, such combinatorial minimal surfaces always exist. We use a technique, adapted from…

We use curvature decompositions to construct generating sets for the space of algebraic curvature tensors and for the space of tensors with the same symmetries as those of a torsion free, Ricci symmetric connection; the latter naturally…

The purpose of this note is to study the number of elements in Minkowski bases on algebraic surfaces with rational polyhedral pseudo-effective cone.

This note provides a Lefschetz theorem for Minkowski sums of polytopes, and conclude lower bound theorems for Minkowski sums of polytopes. It is written as an appendix to arXiv:1405.7368, so notation and references follow that paper.

We use a combinatorial interpretation of the coefficients of zonal Kerov polynomials as a number of unoriented maps to derive an explicit formula for the coefficients in genus one.

Eigenvectors of tensors, as studied recently in numerical multilinear algebra, correspond to fixed points of self-maps of a projective space. We determine the number of eigenvectors and eigenvalues of a generic tensor, and we show that the…

We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in 3D. We do not assume general position. Namely, we handle degenerate input, and produce exact results. We…

Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…

We investigate several families of multiple orthogonal polynomials associated with weights for which the moment generating functions are hypergeometric series with slightly varying parameters. The weights are supported on the unit interval,…

We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…