No more than 2d+1-2 nearly neighbourly simplices in R^d

DOI10.1007/S00454-019-00170-2MaRDI QIDQ2046444zbMATH OpenOpenAlexWikidataFDO

Authors Andrzej Kisielewicz, Krzysztof Przesławski

Publication date 18 August 2021

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.13176

zbMATH Keywords

Boolean functionsFourier transformnearly neighbourly simplices

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) (n)-dimensional polytopes (52B11) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Abstract: 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 $mathbb{R}^d$.

Review text

A family of \(d\)-simplices in \({\mathbb R}^d\) is called \textit{nearly neighbourly} if every two members are separated by a hyperplane that contains a facet of each. In this paper it is shown that \(2^{d+1}-2\) is an upper bound for the cardinality of a nearly neighbourly family of \(d\)-simplices. The previous upper bound was \(2^{d+1}-1\).

Recommendations

• scientific article; zbMATH DE number 3888434
• Revisiting the 2d neighborly d-simplices in E^d
• Putting convex \(d\)-polytopes inside frames
• Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
• Nearly neighbourly families of standard boxes

Cites work

• A Conjecture Concerning Neighboring Tetrahedra
• Analysis of Boolean Functions
• scientific article; zbMATH DE number 3888434 (Why is no real title available?)
• scientific article; zbMATH DE number 1318047 (Why is no real title available?)
• scientific article; zbMATH DE number 3205160 (Why is no real title available?)
• Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
• Neighborly families of \(2^ k\) k-simplices in \(E^ k\).
• No nine neighborly tetrahedra exist
• On the decomposition ofkn into complete bipartite graphs
• Proofs from THE BOOK

Cited in

(6)

• Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs
• Sections of simplices
• On the number of pairwise touching simplices
• scientific article; zbMATH DE number 3888434 (Why is no real title available?)
• On the number of neighborly simplices in \(\mathbb{R}^d\)
• Bounds on the cardinalities of families of nearly neighborly quadrilaterals

This page was built for publication: No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046444)