On the number of vertices of the stochastic tensor polytope

From MaRDI portal
Publication:4603679

DOI10.1080/03081087.2017.1310178zbMATH Open1382.15050arXiv1702.04288OpenAlexW2588391312MaRDI QIDQ4603679FDOQ4603679


Authors: Zhongshan Li, Fuzhen Zhang, Xiao-Dong Zhang Edit this on Wikidata


Publication date: 19 February 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Abstract: This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of nimesnimesn stochastic tensors (i.e., triply stochastic arrays of dimension n). By using known results on polytopes (i.e., the Upper and Lower Bound Theorems), we present some new lower and upper bounds. We show that the new upper bound is tighter than the one recently obtained by Chang, Paksoy and Zhang [Ann. Funct. Anal. 7 (2016), no.~3, 386--393] and also sharper than the one in Linial and Luria's [Discrete Comput. Geom. 51 (2014), no.~1, 161--170]. We demonstrate that the analog of the lower bound obtained in such a way, however, is no better than the existing ones.


Full work available at URL: https://arxiv.org/abs/1702.04288




Recommendations




Cites Work


Cited In (10)





This page was built for publication: On the number of vertices of the stochastic tensor polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603679)