On random sections of the cube

dc.creatorLonke, Yossi
dc.date1998-12-21
dc.date.accessioned2026-07-07T05:27:19Z
dc.date.available2026-07-07T05:27:19Z
dc.descriptionLet $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\leq l<m$ are fixed integers and $n\to\8$.
dc.description17 pages; To appear in "Computational and Discrete Geometry"
dc.identifierhttps://arxiv.org/abs/math/9812123
dc.identifierhttp://arxiv.org/abs/math/9812123
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77878
dc.subjectProbability
dc.subject52A22 (Primary) 60D05 (Secondary)
dc.titleOn random sections of the cube
dc.typetext

Files

Collections