A point set whose space of triangulations is disconnected (Q4955888)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1450006
Language Label Description Also known as
default for all languages
No label defined
    English
    A point set whose space of triangulations is disconnected
    scientific article; zbMATH DE number 1450006

      Statements

      A point set whose space of triangulations is disconnected (English)
      0 references
      22 May 2000
      0 references
      triangulations
      0 references
      point configurations
      0 references
      polyhedral subdivision
      0 references
      bistellar flip
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      A polyhedral subdivision of a finite set \(A\) of points in real affine space is a polyhedral complex whose underlying space is the convex hull of \(A\) and such that all the vertices are contained in the given set \(A\). A triangulation is such a subdivision into simplices. The graph of triangulations of \(A\) is defined as follows: the vertices are the triangulations of the point set and two triangulations are joint by an edge if they differ by a so-called bistellar flip. That means that there is a next-to-minimal polyhedral subdivision of the point set whose possible refinements are precisely those two triangulations. In this paper, the author provides the first example of a point set whose graph of triangulations is disconnected. More precisely, he explicitly constructs a triangulation of a set of \(324\) points in \(6\)-dimensional space that does not admit any bistellar flip. Moreover, he considers the poset of all polyhedral subdivisions of the point set ordered by so-called coherent refinement and he proves that this poset is connected if and only if the graph of triangulations is connected. As the example shows this poset may also be disconnected. As the author points out, certain related problems are still open such as the connectivity of the Baues poset for the projection of a simplex or connectivity of toric Hilbert schemes.
      0 references

      Identifiers