Hamiltonian submanifolds of regular polytopes

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages, 4 figures

Scientific paper

10.1007/s00454-009-9151-9

We investigate polyhedral $2k$-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it $k$-Hamiltonian} if it contains the full $k$-skeleton of the polytope. Since the case of the cube is well known and since the case of a simplex was also previously studied (these are so-called {\it super-neighborly triangulations}) we focus on the case of the cross polytope and the sporadic regular 4-polytopes. By our results the existence of 1-Hamiltonian surfaces is now decided for all regular polytopes. Furthermore we investigate 2-Hamiltonian 4-manifolds in the $d$-dimensional cross polytope. These are the "regular cases" satisfying equality in Sparla's inequality. In particular, we present a new example with 16 vertices which is highly symmetric with an automorphism group of order 128. Topologically it is homeomorphic to a connected sum of 7 copies of $S^2 \times S^2$. By this example all regular cases of $n$ vertices with $n < 20$ or, equivalently, all cases of regular $d$-polytopes with $d\leq 9$ are now decided.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Hamiltonian submanifolds of regular polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamiltonian submanifolds of regular polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamiltonian submanifolds of regular polytopes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-111069

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.