A Triangulation of ℂP 3 as Symmetric Cube of S 2
نویسندگان
چکیده
The symmetric group S3 acts on S 2 × S 2 × S 2 by coordinate permutation, and the quotient space (S 2×S 2×S )/S3 is homeomorphic to the complex projective space CP 3. In this paper, we construct an 124-vertex simplicial subdivision (S 2 ×S 2 ×S )124 of the 64vertex standard cellulation S 2 4 × S 2 4 × S 2 4 of S 2 × S 2 × S 2, such that the S3-action on this cellulation naturally extends to an action on (S 2 × S 2 × S )124. Further, the S3-action on (S 2×S 2×S )124 is “good”, so that the quotient simplicial complex (S 2×S 2×S )124/S3 is a 30-vertex triangulation CP 3 30 of CP 3. In other words, we construct a simplicial realization (S 2 × S 2 × S )124 → CP 3 30 of the branched covering S 2 × S 2 × S 2 → CP 3. Finally, we apply the BISTELLAR program of Lutz on CP 3 30, resulting in an 18-vertex 2-neighbourly triangulation CP 3 18 of CP 3. The automorphism group of CP 3 18 is trivial. It may be recalled that, by a result of Arnoux and Marin, any triangulation of CP 3 requires at least 17 vertices. So, CP 3 18 is close to vertex-minimal, if not actually vertex-minimal. Moreover, no explicit triangulation of CP 3 was known so far. MSC 2010: 57Q15, 57R05, 57M60.
منابع مشابه
Algorithms for Finding Connected Separators between Antipodal Points
A set (or a collection of sets) contained in the Euclidean space Rm is symmetric if it is invariant under the antipodal map. Given a symmetric unicoherent polyhedron X (like an n dimensional cube or a sphere) and an odd real function f defined on vertices of a certain symmetric triangulation of X, we algorithmically construct a connected symmetric separator of X by choosing a subcollection of t...
متن کامل. C O ] 1 1 A pr 2 00 2 ASYMPTOTICALLY EFFICIENT TRIANGULATIONS OF THE d - CUBE
We describe a method to triangulate P × Q which is very useful to obtain triangulations of the d-cube I of good asymptotic efficiency. The main idea is to triangulate P × Q from a triangulation of Q and another of P ×∆, where ∆ is a simplex of dimension m− 1, which is supposed to be smaller than dim(Q) = n− 1. Last triangulation will induce a triangulation of P ×∆. Thus, considering P := I and ...
متن کاملCombinatorial Integer Labeling Theorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations
Tucker’s well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {±1,±2, · · · ,±n} with the property that antipodal vertices on the boundary of the cube are assigned opposite labels, the triangulation admits a 1-dimensional simplex whose two...
متن کاملCombinatorial Integer Labeling Theorems on Finite Sets with Applications
Tucker’s well-known combinatorial lemma states that, for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {±1,±2, . . . ,±n} with the property that antipodal vertices on the boundary of the cube are assigned opposite labels, the triangulation admits a 1-dimensional simplex whose tw...
متن کاملCombinatorial Integer Labeling Theorems on Finite Sets with Applications1
Tucker’s well-known combinatorial lemma states that, for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {±1,±2, · · · ,±n} with the property that antipodal vertices on the boundary of the cube are assigned opposite labels, the triangulation admits a 1-dimensional simplex whose tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 48 شماره
صفحات -
تاریخ انتشار 2012