Hunter Swan
Published 2018-08-28Version 1
Given a random k-dimensional cross-section of a hypercube, what is its expected number of vertices? We show that, for a suitable distribution of random slices, the answer is $2^k$, independent of the dimension of the hypercube.
Comments: 5 pages, 2 figures
Journal: Swan, H. (2016). Expected Number of Vertices of a Hypercube Slice. The American Mathematical Monthly, 123(6), 600-604
Asymptotics for the expected number of nodal components for random lemniscates
Expected number of critical points of random holomorphic sections over complex projective space
On the expected number of different records in a random sample
![QR code for arXiv:1808.09482 [math.PR]](http://oss.arxitics.com/images/favicon.svg)