arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.09482math.PRmath.MG
收藏

超立方体切片的期望顶点数

Expected Number of Vertices of a Hypercube Slice

Hunter Swan

摘要:

给定一个超立方体的随机k维截面,它的期望顶点数是多少?我们表明,对于一个合适的随机切片分布,答案是$2^k$,独立的超立方体的维度。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑