At most 2d+1 neighborly simplices in Ed

M. A. Perles

doi:10.1016/S0304-0208(08)72832-9

At most 2^d+1 neighborly simplices in E^d

M. A. Perles^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

A family of d-simplices in E^d is called “neighborly” if every pair of them has a (d‑1)-dimensional intersection. Let f(d) denote the maximum number of d-simplices in a neighborly family in E^d. It significantly improves the upper bound of f(d). A neighborly family of d-polytopes in E^d, each having at most k facets, can have at most 2^k members.

Original language	English
Pages (from-to)	253-254
Number of pages	2
Journal	North-Holland Mathematics Studies
Volume	87
Issue number	C
DOIs	https://doi.org/10.1016/S0304-0208(08)72832-9
State	Published - 1 Jan 1984

Access to Document

10.1016/S0304-0208(08)72832-9

Cite this

@article{12052d3d9a164e67a493e464530d7a00,

title = "At most 2d+1 neighborly simplices in Ed",

abstract = "A family of d-simplices in Ed is called “neighborly” if every pair of them has a (d‑1)-dimensional intersection. Let f(d) denote the maximum number of d-simplices in a neighborly family in Ed. It significantly improves the upper bound of f(d). A neighborly family of d-polytopes in Ed, each having at most k facets, can have at most 2k members.",

author = "Perles, \{M. A.\}",

year = "1984",

month = jan,

day = "1",

doi = "10.1016/S0304-0208(08)72832-9",

language = "אנגלית",

volume = "87",

pages = "253--254",

journal = "North-Holland Mathematics Studies",

issn = "0304-0208",

publisher = "Elsevier B.V.",

number = "C",

}

TY - JOUR

T1 - At most 2d+1 neighborly simplices in Ed

AU - Perles, M. A.

PY - 1984/1/1

Y1 - 1984/1/1

N2 - A family of d-simplices in Ed is called “neighborly” if every pair of them has a (d‑1)-dimensional intersection. Let f(d) denote the maximum number of d-simplices in a neighborly family in Ed. It significantly improves the upper bound of f(d). A neighborly family of d-polytopes in Ed, each having at most k facets, can have at most 2k members.

AB - A family of d-simplices in Ed is called “neighborly” if every pair of them has a (d‑1)-dimensional intersection. Let f(d) denote the maximum number of d-simplices in a neighborly family in Ed. It significantly improves the upper bound of f(d). A neighborly family of d-polytopes in Ed, each having at most k facets, can have at most 2k members.

UR - https://www.scopus.com/pages/publications/77956942079

U2 - 10.1016/S0304-0208(08)72832-9

DO - 10.1016/S0304-0208(08)72832-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:77956942079

SN - 0304-0208

VL - 87

SP - 253

EP - 254

JO - North-Holland Mathematics Studies

JF - North-Holland Mathematics Studies

IS - C

ER -

At most 2^d+1 neighborly simplices in E^d

Abstract

Access to Document

Other files and links

Fingerprint

Cite this