A combinatorial study of multiplexes and ordinary polytopes
| dc.creator | Bayer, Margaret M. | |
| dc.creator | Bruening, Aaron M. | |
| dc.creator | Stewart, Joshua | |
| dc.date | 2001-01-09 | |
| dc.date.accessioned | 2026-07-07T04:39:35Z | |
| dc.date.available | 2026-07-07T04:39:35Z | |
| dc.description | Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag vector of the multiplex is computed, and shown to equal the flag vector of a many-folded pyramid over a polygon. Multiplexes, but not other ordinary polytopes, are shown to be elementary. It is shown that all complete subgraphs of the graph of a multiplex determine faces of the multiplex. The toric h-vectors of the ordinary 5-dimensional polytopes are given. Graphs of ordinary polytopes are studied. Their chromatic numbers and diameters are computed, and they are shown to be Hamiltonian. | |
| dc.identifier | https://arxiv.org/abs/math/0101076 | |
| dc.identifier | http://arxiv.org/abs/math/0101076 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/60725 | |
| dc.subject | Combinatorics | |
| dc.subject | 52B05 | |
| dc.title | A combinatorial study of multiplexes and ordinary polytopes | |
| dc.type | text |