Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-30T20:36:49.100Z Has data issue: false hasContentIssue false
  • English
  • Français

On a class of generalized simplices

Part of: Polytopes and polyhedra

Published online by Cambridge University Press:  26 February 2010

T. Bisztriczky
T. Bisztriczky
Affiliation:
Department of Mathematics and Statistics, The University of Calgary, Calgary, Alberta, CanadaT2N 1N4.
Get access

Abstract

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.

MSC classification

Secondary: 52B12: Special polytopes (linear programming, centrally symmetric, etc.)
Type
Research Article
Information
Mathematika , Volume 43 , Issue 2 , December 1996 , pp. 274 - 285
Copyright
Copyright © University College London 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Bisztriczky, T.. Ordinary 3-polytopes. Geom. Ded., 52 (1994), 129–142.CrossRefGoogle Scholar
2.Bisztriczky, T.. Ordinary (2m + 1)-polytopes. To appear in the Israel J. of Math.Google Scholar
3.Gould, H. W.. Combinatorial Identities (Morgantown Printing, West Virginia, 1972).Google Scholar
4.McMullen, P. and Shephard, G. C.. Convex Polytopes and the Upper Bound Conjecture, Lecture Notes Series 3, L.M.S. (Cambridge University Press, 1971).Google Scholar
5.Schaer, J.. Contributed problems. In Bisztriczky, T.McMullen, P.Schneider, R.Ivic Weiss, A., editors, Polytopes: abstract, convex and computational, NATO AS1 Series C, Vol. 440 (Kluwer Academic Publishers. 1994).Google Scholar