1
Donoho D L, Tanner J. Neighborliness of randomly projected simplices in high dimensions[J]. Proceedings of the National Academy of Sciences of the United States of America, 2005, 102(27): 9452-9457.
2
Donoho D L, Tanner J. Counting faces of randomly projected polytopes when the projection radically lowers dimension[J]. Journal of the American Mathematical Society, 2009, 22(1): 1-53.
3
David L Donoho. High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension ∗. 2005.
4
Affentranger F, Schneider R. Random projections of regular simplices[J]. Discrete and Computational Geometry, 1992, 7(3): 219-226.
5
Donoho D L, Tanner J. Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling[J]. IEEE Transactions on Information Theory, 2010, 56(4): 2002-2016.
6
Brczky K, Henk M. Random projections of regular polytopes[J]. Archiv der Mathematik, 1999, 73(6): 465-473.
7
Stojnic M. -Optimization in Block-Sparse Compressed Sensing and Its Strong Thresholds[J]. IEEE Journal of Selected Topics in Signal Processing, 2010, 4(2): 350-357.
8
Betke U, Henk M. Intrinsic volumes and lattice points of crosspolytopes[J]. Monatshefte für Mathematik, 1993: 27-33.
9
Mccoy M B, Tropp J A. Sharp Recovery Bounds for Convex Demixing, with Applications[J]. Foundations of Computational Mathematics, 2014, 14(3): 503-567.
10
Hadwiger H. Gitterpunktanzahl im Simplex und Wills\u0027sche Vermutung[J]. Mathematische Annalen, 1979, 239(3): 271-288.