Enumeration and constructions of vertices of the polytope of polystochastic matrices
Anna A. Taranenko

TL;DR
This paper characterizes all vertices of specific high-dimensional polytopes of polystochastic matrices, correcting previous results and introducing new construction methods for vertices, including symmetric ones with large support.
Contribution
It identifies all vertices of the polytopes _4^3 and _3^4, corrects earlier findings, and develops new constructions for vertices using multidimensional matrix products.
Findings
Vertices of _4^3 and _3^4 are fully characterized.
New methods for constructing vertices of _n^d are proposed.
Symmetric vertices of _3^d with large support are identified.
Abstract
A multidimensional nonnegative matrix is called polystochastic if the sum of entries in each of its lines equals . The set of all polystochastic matrices of order and dimension is a convex polytope known as the Birkhoff polytope. In this paper, we identify all vertices of the polytopes and correcting the results of Ke, Li, and Xiao (2016). Additionally, we describe constructions vertices of using multidimensional matrix products and find symmetric vertices of for all with large support sizes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems
