volume 27, issue 1, P49-63 2002
DOI: 10.1007/s00454-001-0051-x
View full text
|
|
Share

Abstract: Abstract. 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 …

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
6
0

Publication Types

Select...

Relationship

0
0

Authors

Journals