The Flip-Graph of the 4-Dimensional Cube is Connected

@article{Pournin2013TheFO,
  title={The Flip-Graph of the 4-Dimensional Cube is Connected},
  author={Lionel Pournin},
  journal={Discrete \& Computational Geometry},
  year={2013},
  volume={49},
  pages={511-530}
}
  • L. Pournin
  • Published 31 January 2012
  • Mathematics
  • Discrete & Computational Geometry
Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence that this vertex set has 92,487,256 triangulations, partitioned into 247,451 symmetry classes. 

The MST-fan of a regular subdivision

. The dual graph Γ( h ) of a regular triangulation Σ( h ) carries a natural metric structure. The minimum spanning trees of Γ( h ) recently proved to be conclusive for detecting significant data

Breadth-first search on a Ramanujan graph

TLDR
The argument is based on the expander mixing lemma, which entails that the results are strongest for Ramanujan graphs, which asymptotically maximize the spectral gap.

Voronoi Diagrams and Delaunay Triangulations: Ubiquitous Siamese Twins

Keywords: Voronoi ; Delaunay ; tesselations ; triangulations ; flip-graphs Reference EPFL-CHAPTER-181846 URL: http://www.math.uiuc.edu/documenta/vol-ismp/60_liebling-thomas.html Record created on

Parallel Enumeration of Triangulations

TLDR
Down-flip reverse search allows for massive parallelization, i.e., it scales well even for many cores, and allows to compute the triangulations of much larger point sets than before.

16 SUBDIVISIONS AND TRIANGULATIONS OF POLYTOPES

TLDR
This chapter treats a subdivision as a set of subsets of V , whose convex hulls subdivide P .

Random growth on a Ramanujan graph.

The behavior of a certain random growth process is analyzed on arbitrary regular and non-regular graphs. Our argument is based on the Expander Mixing Lemma, which entails that the results are

References

SHOWING 1-10 OF 14 REFERENCES

TOPCOM: Triangulations of Point Configurations and Oriented Matroids

TLDR
The core algorithms implemented in TOPCOM are described, and implentation issues are discussed.

Nonregular triangulations of products of simplices

TLDR
The authors' nonregular triangulation of ▽3×▽3 can be extended to a non regular triangulations of the six-dimensional cube, which is the smallest cube with a nonregularTriangulation.

Weakly Regular Subdivisions

TLDR
It is shown that 2-dimensional subdivisions can be made regular by moving their vertices within parallel 1-dimensional spaces by way of projection from the boundary complex of a 4-polytope.

A point set whose space of triangulations is disconnected

In this paper we explicitly construct a triangulation of a 6-dimensional point configuration of 324 points which admits no geometric bistellar operations (or flips, for short). This triangulation is

Lifting simplicial complexes to the boundary of convex polytopes

The hyperdeterminant and triangulations of the 4-cube

TLDR
The 4-cube has 80876 coarsest regular subdivisions, one for each facet of thesecondary polytope, but only 268 of them come from the hyperdeterminant, which is a polynomial of degree 24 in 16 unknowns which has 2894276 terms.

Triangulations: Structures for Algorithms and Applications

Triangulations appear everywhere, from volume computations and meshing to algebra and topology. This book studies the subdivisions and triangulations of polyhedral regions and point sets and presents

Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten

Discriminants, Resultants, and Multidimensional Determinants

Preface.- Introduction.- General Discriminants and Resultants.- Projective Dual Varieties and General Discriminants.- The Cayley Method of Studying Discriminants.- Associated Varieties and General