No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\) (Q2046444)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7382957
Language Label Description Also known as
default for all languages
No label defined
    English
    No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\)
    scientific article; zbMATH DE number 7382957

      Statements

      No more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\) (English)
      0 references
      18 August 2021
      0 references
      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\).
      0 references
      nearly neighbourly simplices
      0 references
      Fourier transform
      0 references
      Boolean functions
      0 references

      Identifiers