Arbitrarily large neighborly families of symmetric convex polytopes
A family of convex d-polytopes in \(E^ d\) is called neighborly if every two of them have a (d-l)-dimensional intersection. The purpose of this paper is to solve a problem of Grünbaum, showing that for every d, \(d\geq 3\), there exist arbitrarily large neighborly families of centrally symmetric convex d-polytopes in \(E^ d\), moreover, each member in such a family can be chosen to have a k-flat center of symmetry, for any k, \(0\leq k\leq d-1.\) In addition the author proves that for every \(d\geq 4\), m and t, \(0\leq t\leq d-1,\) there exists in \(E^ d\) a neighborly family of m congruent d-polytopes having a t-flat center of symmetry.
neighborly families of centrally symmetric convex d-polytopes in
neighborly families of centrally symmetric convex d-polytopes in \(E^ d\)
scientific article; zbMATH DE number 3949174
scientific article