Abstract.
Let f(j,k,n) denote the expected number of j -faces of a random k -section of the n -cube. A formula for f(0,k,n) is presented, and, for j\geq 1 , a lower bound for f(j,k,n) is derived, which implies a precise asymptotic formula for f(n-m,n-l,n) when 1≤ l<m are fixed integers and n→∈fty .
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received August 1, 1998, and in revised form December 15, 1998.
Rights and permissions
About this article
Cite this article
Lonke, Y. On Random Sections of the Cube . Discrete Comput Geom 23, 157–169 (2000). https://doi.org/10.1007/PL00009493
Issue Date:
DOI: https://doi.org/10.1007/PL00009493