Asymptotic bounds on the numbers of vertices of polytopes of polystochastic matrices

A multidimensional nonnegative matrix is called polystochastic if the sum of the entries in each line is equal to 1. The set of all polystochastic matrices of order n and dimension d forms a convex polytope Ω n d . In the present paper, we compare known bounds on the number of vertices of the polytope Ω n d and prove that the number of vertices of Ω 3 d is doubly exponential in d .

Authors

Institutions

Publication Details

Journal
Discrete Mathematics
Published
2025-07-01
DOI
https://doi.org/10.1016/j.disc.2025.114653
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Asymptotic bounds on the numbers of vertices of polytopes of polystochastic matrices

Anna A. Taranenko, Vladimir N. Potapov
Discrete Mathematics
Advanced Combinatorial Mathematics
article

Asymptotic bounds on the numbers of vertices of polytopes of polystochastic matrices

Anna A. Taranenko, Vladimir N. Potapov
article en

Abstract

A multidimensional nonnegative matrix is called polystochastic if the sum of the entries in each line is equal to 1. The set of all polystochastic matrices of order n and dimension d forms a convex polytope Ω n d . In the present paper, we compare known bounds on the number of vertices of the polytope Ω n d and prove that the number of vertices of Ω 3 d is doubly exponential in d .

Discrete MathematicsVol. 349(1)
Sobolev Institute of Mathematics (RU)
Openalex Percentile: Top 78%
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.