Monotonicity of expected f-vectors for projections of regular polytopes
classification
🧮 math.PR
math.MG
keywords
polytoperegularexpectedgaussiannumberdimensionalfacesfunction
read the original abstract
Let $P_n$ be an $n$-dimensional regular polytope from one of the three infinite series (regular simplices, regular crosspolytopes, and cubes). Project $P_n$ onto a random, uniformly distributed linear subspace of dimension $d\geq 2$. We prove that the expected number of $k$-dimensional faces of the resulting random polytope is an increasing function of $n$. As a corollary, we show that the expected number of $k$-faces of the Gaussian polytope is an increasing function of the number of points used to generate the polytope. Similar results are obtained for the symmetric Gaussian polytope and the Gaussian zonotope.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.