Related papers: Vertices of the polytope of polystochastic matrice…
A multidimensional nonnegative matrix is called polystochastic if the sum of entries in each of its lines equals $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$ known as the…
A multidimensional nonnegative matrix is called polystochastic if the sum of entries in each line is equal to $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$. In the present…
A multidimensional nonnegative matrix is called polystochastic if the sum of its entries over each line is equal to $1$. The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. We prove that if $d$…
A $d$-dimensional matrix is called \emph{$1$-polystochastic} if it is non-negative and the sum over each line equals~$1$. Such a matrix that has a single $1$ in each line and zeros elsewhere is called a \emph{$1$-permutation} matrix. A…
A nonnegative multidimensional matrix is called polystochastic if the sum of its entries over each line is equal to $1$. In this paper we overview known results on positiveness of the permanent of polystochastic matrices and prove that the…
Considering $n\times n\times n$ stochastic tensors $(a_{ijk})$ (i.e., nonnegative hypermatrices in which every sum over one index $i$, $j$, or $k$, is 1), we study the polytope ($\Omega_{n}$) of all these tensors, the convex set ($L_n$) of…
The $n\times n$ doubly stochastic matrices constitute a polytope in $\mathbb{R}^{n^2}$, and by Birkhoff's theorem, its vertex set coincides with the set of order-$n$ permutation matrices.\\ A tristochastic array is an $n \times n\times n$…
Consider the Birkhoff polytope of n by n doubly-stochastic matrices. As the Birkhoff-von Neumann theorem famously states, its vertex set coincides with the set of all n by n permutation matrices. Here we seek a higher-dimensional analog of…
This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…
We study the calculation of the volume of the polytope B_n of n by n doubly stochastic matrices; that is, the set of real non-negative matrices with all row and column sums equal to one. We describe two methods. The first involves a…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…
A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…
The set of bistochastic or doubly stochastic N by N matrices form a convex set called Birkhoff's polytope, that we describe in some detail. Our problem is to characterize the set of unistochastic matrices as a subset of Birkhoff's polytope.…
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.
Let $\Omega_n$ denote the class of $n \times n$ doubly stochastic matrices (each such matrix is entrywise nonnegative and every row and column sum is 1). We study the diagonals of matrices in $\Omega_n$. The main question is: which $A \in…
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
Orthostochastic matrices are the entrywise squares of orthogonal matrices, and naturally arise in various contexts, including notably definite symmetric determinantal representations of real polynomials. However, defining equations for the…
For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…
The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…