A combinatorial study of multiplexes and ordinary polytopes (Q1349291)

In two papers \textit{T. Bisztriczky} [Geom. Dedicata 52, No. 2, 129-142 (1994; Zbl 0813.52010) and Mathematika 43, No. 2, 274-285 (1996; Zbl 0874.52007), see also Isr. J. Math. 102, 101-123 (1997; Zbl 0890.52007)] introduced ordinary polytopes and multiplexes; these generalize cyclic polytopes and simplices, respectively. The present authors describe various combinatorial properties of these polytopes. For example, a multiplex has the same flag vector as a manifold pyramid over a polygon, and so is elementary (its toric \(h\)-vector has just two different entries); moreover, all complete subgraphs of its graph determine faces. The graphs of ordinary polytopes are shown to be Hamiltonian, and their chromatic numbers and diameters are found. The toric \(h\)-vectors of ordinary \(5\)-polytopes are also computed, and the \(f\)-vectors of ordinary polytopes are given. Note that the title of the reviewer's paper [11] is misquoted; in fact, the paper that should be cited in the context is [\textit{P. McMullen}, Isr. J. Math. 9, 559-570 (1971; Zbl 0209.53701)].