Back to Search
Start Over
Flip-Connectivity of Triangulations of the Product of a Tetrahedron and Simplex
- Source :
- Discrete & Computational Geometry. 63:1-30
- Publication Year :
- 2019
- Publisher :
- Springer Science and Business Media LLC, 2019.
-
Abstract
- A flip is a minimal move between two triangulations of a polytope. The set of triangulations of a polytope was shown by Santos to not always be connected by flips, and it is an interesting problem to find large classes of polytopes for which it is. One such class which has received considerable attention is the product of two simplices. Santos proved that the set of triangulations of a product of two simplices is connected by flips when one of the simplices is a triangle. However, the author showed that it is not connected when one of the simplices is four-dimensional and the other has very large dimension. In this paper we show that it is connected when one of the simplices is a tetrahedron, thereby extending Santos’s result as far as possible.
- Subjects :
- Class (set theory)
Simplex
Dimension (graph theory)
Polytope
0102 computer and information sciences
02 engineering and technology
Computer Science::Computational Geometry
01 natural sciences
Theoretical Computer Science
Combinatorics
Set (abstract data type)
Computational Theory and Mathematics
010201 computation theory & mathematics
Flip
Product (mathematics)
FOS: Mathematics
0202 electrical engineering, electronic engineering, information engineering
Tetrahedron
Mathematics - Combinatorics
Mathematics::Metric Geometry
Discrete Mathematics and Combinatorics
020201 artificial intelligence & image processing
Combinatorics (math.CO)
Geometry and Topology
Mathematics
Subjects
Details
- ISSN :
- 14320444 and 01795376
- Volume :
- 63
- Database :
- OpenAIRE
- Journal :
- Discrete & Computational Geometry
- Accession number :
- edsair.doi.dedup.....5780add12ac5b5270188d734c0a5f117