Asymptotic bounds on the numbers of vertices of polytopes of polystochastic matrices
Abstract
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 nd. In the present paper, we compare known bounds on the number of vertices of the polytope nd and prove that the number of vertices of 3d is doubly exponential on d.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.