Neighborly cubical polytopes

Details Neighborly cubical polytopes Neighborly cubical polytopes

1998-12-05

arxiv.org/abs/math/9812033v2

Mathematics

Combinatorics

20 pages, 3 figures, Latex2e (Revised version, with a new result and a major correction)

Scientific paper

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera & Chan. Kalai conjectured that the boundary $\partial C^n_d$ of a neighborly cubical polytope $C^n_d$ maximizes the $f$-vector among all cubical $(d-1)$-spheres with $2^n$ vertices. While we show that this is true for polytopal spheres for $n\le d+1$, we also give a counter-example for $d=4$ and $n=6$. Further, the existence of neighborly cubical polytopes shows that the graph of the $n$-dimensional cube, where $n\ge5$, is ``dimensionally ambiguous'' in the sense of Gr\"unbaum. We also show that the graph of the 5-cube is ``strongly 4-ambiguous''. In the special case $d=4$, neighborly cubical polytopes have $f_3=f_0/4 \log_2 f_0/4$ vertices, so the facet-vertex ratio $f_3/f_0$ is not bounded; this solves a problem of Kalai, Perles and Stanley studied by Jockusch.

Affiliated with

Also associated with

No associations

Rating

Neighborly cubical polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Neighborly cubical polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Neighborly cubical polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-458026