A triangulation of \(\mathbb CP ^{3}\) as symmetric cube of \(S ^{2}\) (Q452007): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: simpcomp / rank | |||
Normal rank |
Revision as of 15:41, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A triangulation of \(\mathbb CP ^{3}\) as symmetric cube of \(S ^{2}\) |
scientific article |
Statements
A triangulation of \(\mathbb CP ^{3}\) as symmetric cube of \(S ^{2}\) (English)
0 references
19 September 2012
0 references
In a previous paper [ibid. 46, 542--560 (2011; Zbl 1231.51016)] the authors constructed a 10-vertex triangulation of \(\mathbb{C} P^2\) as a branched quotient of the 16-vertex product \(S^2\times S^2\), subdivided in a certain way. This branched simplicial covering preserves a large part of the symmetry. In the paper under review, they start with the 64-vertex product \(S^2\times S^2\times S^2\), subdivided in a certain way, and construct a 30-vertex simplicial triangulation of \(\mathbb{C}^3\) as a branched quotient. Here the subdivision requires 60 extra vertices since there is no simultaneous and coherent triangulation of all the various cubes that come in here. The mapping from \((S^2)^3\) to \(\mathbb{C} P^3\) is a simplicial branched covering, and again a large symmetry group is preserved. By bi-stellar moves, the number of vertices for \(\mathbb{C} P^3\) could be reduced to 18 but not (or not yet) to 17. There is no 16-vertex triangulation according to \textit{P. Arnoux} and \textit{A. Marin} [Mem. Fac. Sci., Kyushu Univ., Ser. A 45, No. 2, 1670--244 (1991; Zbl 0753.52002)].
0 references
branched simplicial covering
0 references
simplicial subdivision
0 references
complex projective space
0 references