Hamiltonian submanifolds of regular polytopes

Felix Effenberger

ISBN 978-3-8325-2758-7
194 pages, year of publication: 2011
price: 38.00 €
Hamiltonian submanifolds of regular polytopes
This work is set in the field of combinatorial topology, sometimes also referred to as discrete geometric topology, a field of research in the intersection of topology, geometry, polytope theory and combinatorics. The main objects of interest in the field are simplicial complexes that carry some additional structure, forming combinatorial triangulations of the underlying PL manifolds. In particular, polyhedral manifolds as subcomplexes of the boundary complex of a convex regular polytope are investigated. Such a subcomplex is called k-Hamiltonian if it contains the full k-skeleton of the polytope.

The notion of tightness of a PL-embedding of a triangulated manifold is closely related to its property of being a Hamiltonian subcomplex of some convex polytope. Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplex-wise linear embedding of the triangulation into Euclidean space is "as convex as possible". It can thus be understood as a generalization of the concept of convexity.

In even dimensions, there exist purely combinatorial conditions which imply the tightness of a triangulation. In this work, other sufficient and purely combinatorial conditions which can be applied to the odd-dimensional case as well are presented.

cover cover cover cover cover cover cover cover cover
  • Triangulierte Mannigfaltigkeit
  • Hamiltonscher Unterkomplex
  • Straffheit
  • Zentralsymmetrisch
  • Stapelpolytop


38.00 €
in stock

36.50 €
48.00 €
52.00 €

(D) = Within Germany
(W) = Abroad

*You can purchase the eBook (PDF) alone or combined with the printed book (eBundle). In both cases we use the payment service of PayPal for charging you - nevertheless it is not necessary to have a PayPal-account. With purchasing the eBook or eBundle you accept our licence for eBooks.

For multi-user or campus licences (MyLibrary) please fill in the form or write an email to