Related papers: Combinatorial Methods for Minkowski Tensors of Pol…
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 provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…
The Brunn-Minkowski theory in convex geometry concerns, among other things, the volumes, mixed volumes, and surface area measures of convex bodies. We study generalizations of these concepts to Borel measures with density in…
The purpose of this paper is to prove that the Mirkovic-Vilonen (MV for short) polytope corresponding to the tensor product of two arbitrary MV polytopes is contained in the Minkowski sum of these two MV polytopes. This generalizes the…
Higher-rank Minkowski valuations are efficient means for describing the geometry and connectivity of spatial patterns. We show how to extend the framework of the scalar Minkowski valuations to vector- and tensor-valued measures. The…
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…
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…
We study vectors formed by entries on the diagonal of standard Young tableaux of shifted shapes. Such vectors are in bijection with integer lattice points of certain integral polytopes, which are Minkowski sums of simplices. We also…
A complete classification of \(\mathrm{SL}(n)\) contravariant, \(p\)-order tensor valuations on convex polytopes in \( \mathbb{R}^n \) for \( n \geq p \) is established without imposing additional assumptions, particularly omitting any…
In this paper we describe a method to compute Generalized Polarization Tensors. These tensors are the coefficients appearing in the multipolar expansion of the steady state voltage perturbation caused by an inhomogeneity of constant…
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…
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric…
Hermann Minkowski introduced a function in 1904 which maps quadratic irrational numbers to rational numbers and this function is now known as Minkowski's question mark function since Minkowski used the notation $?(x)$. This function is a…
There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank…
The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…
For material modeling of microstructured media, an accurate characterization of the underlying microstructure is indispensable. Mathematically speaking, the overall goal of microstructure characterization is to find simple functionals which…
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…
Motivated by applications in local stereology, a new rotational Crofton formula is derived for Minkowski tensors. For sets of positive reach, the formula shows how rotational averages of intrinsically defined Minkowski tensors on sections…
We illustrate a rigorous approach to express the totally symmetric isotropic tensors of arbitrary rank in the $n$-dimensional Euclidean space as a linear combination of products of Kronecker deltas. By making full use of the symmetries, one…
In tolerancing analysis, geometrical or contact specifications can be represented by polytopes. Due to the degrees of invariance of surfaces and that of freedom of joints, these operand polytopes are originally unbounded in most of the…