No More Than 2^d+1-2 Nearly Neighbourly Simplices in ℝ^d

Andrzej P. Kisielewicz,Krzysztof Przesławski

Discrete & Computational Geometry（2020）

引用 0|浏览1

暂无评分

摘要

We prove a combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there are at most 2^d+1-2 nearly neighbourly simplices in ℝ^d .

查看译文

关键词

Nearly neighbourly simplices,Fourier transform,Boolean functions

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要