Algorithms for the toric Hilbert scheme

From MaRDI portal





Let \(R = {\mathbb C}[x_1,\ldots, x_n]\) be the polynomial ring graded by a non-negative \(d\times n\)-matrix \(A = (a_1, \ldots, a_n)\) of non-negative integers such that \(\deg x_i = a_i \in {\mathbb N}^d\) is given by a vector. This defines a decomposition \(R = \bigoplus_{b \in {\mathbb N}A} R_b,\) where \({\mathbb N}A\) denotes the subsemigroup of \({\mathbb N}^d\) generated by the vectors \(a_1, \ldots, a_n\) and \(R_b\) is the \({\mathbb C}\)-span of an element \(b\) of the subsemigroup. The toric Hilbert scheme parametrizes all the \(A\)-homogeneous ideals \(I \subset R\) with the property that the graded component \((R/I)_b\) is a 1-dimensional \({\mathbb C}\)-vector space. This concept was summarized by \textit{B. Sturmfels} in the first chapter of his book ``Gröbner bases and convex polytopes, Univ. Lect. Ser. 8 (1996; Zbl 0856.13020)]. In the paper under review, the authors illustrate the use of Macaulay 2 for exploring the structure of toric Hilbert schemes. It is known that all the components of the scheme are toric varieties. Among them there is a fairly well understood component, the coherent component. The results contribute to the open problem whether toric Hilbert schemes are always connected. In their investigations the authors encounter algorithms from commutative algebra, polyhedral theory and geometric combinatorics. For the entire collection see [Zbl 0973.00017].





Describes a project that uses

Uses Software






This page was built for publication: Algorithms for the toric Hilbert scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763709)