Premium
On a class of generalized simplices
Author(s) -
Bisztriczky T.
Publication year - 1996
Publication title -
mathematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.955
H-Index - 29
eISSN - 2041-7942
pISSN - 0025-5793
DOI - 10.1112/s0025579300011773
Subject(s) - mathematics , combinatorics , simplex , facet (psychology) , vertex (graph theory) , polytope , class (philosophy) , graph , dual polyhedron , computer science , artificial intelligence , psychology , social psychology , personality , big five personality traits
We recall that if S is a d ‐ simplex then each facet and each vertex figure of S is a ( d − 1)‐simplex and S is a self‐dual. We introduce a d ‐polytope P , called a d ‐multiplex, with the property that each facet and each vertex figure of P is a ( d − 1)‐multiplex and P is self‐dual.