Non-connected toric Hilbert schemes (Q2484090): Difference between revisions

The graph of triangulations of a finite point set \(A\subset R^d\) has as vertices all the triangulations of \(A\) and as edges certain modifications of triangulations similar to the bistellar flips, see [\textit{I. M. Gelfand, M. M. Kapranov} and \textit{A. V. Zelevinsky}, Discriminants, resultants, and multidimensional determinants. Mathematics: Theory and Applications. Boston, MA: Birkhäuser (1994; Zbl 0827.14036); \textit{C. L. Lawson}, Proc. Symp., Madison 1977, 161--194 (1977; Zbl 0407.68033); \textit{V. Reiner}, Math. Sci. Res. Inst. Publ. 38, 293--336 (1999; Zbl 0956.52011); \textit{F. Hurtado, M. Noy} and \textit{J. Urrutia}, Discrete Comput. Geom. 22, No. 3, 333--346 (1999; Zbl 0939.68135)]. The author constructs two small point sets \(A_{26}\) and \(A_{50}\) in \(R^5\), with 50 and 26 points respectively, whose graphs of triangulations and toric Hilbert schemes are not connected, cf. [\textit{F. Santos}, J. Am. Math. Soc. 13, No. 3, 611--637 (2000; Zbl 0958.52017)]. Moreover, it is demonstrated that the constructed point sets may be perturbed into convex positions, so there exist convex polytopes in \(R^5\) with non-connected graphs of triangulations. The author analyses the number and dimension of connected components of graphs and toric Hilbert schemes in question.