numericalHilbertFunction(F, I, S, d)
numericalHilbertFunction(F, I, d)
This method computes values of the Hilbert function of the image of a variety, by numerical interpolation. In more detail, given a list $S$ of general points on $F(V(I))$ and a degree $d$, the method forms a matrix whose entries are the evaluations of monomials of degree $d$ at points in $S$. The kernel of this interpolation matrix gives degree $d$ equations of the image (provided the number of points in $S$ is at least the number of degree $d$ monomials). This technique circumvents the calculation of the kernel of the associated ring map.
In order to speed up computation, the list $S$ of points can be precomputed (see numericalImageSample). This list of points can then be reused in multiple interpolation computations (which can yield a large speedup over performing separate sampling instances, if the ideal $I$ is not the zero ideal).
For a further speedup, the option UseSLP allows for the usage of straightline programs in creating the interpolation matrix.
In the following, we compute the dimension of the space of quartics in the ideal of the twisted cubic and obtain the expected answer, $22$. Note that one can verify this by dimension counting: quartics in the coordinate ring pull back to forms of degree $12$ on $P^1$, of which there is a $13$dimensional space; thus the space of quartics in the defining ideal has dimension $35  13 = 22$.



The following example computes the dimension of Plücker quadrics in the defining ideal of the Grassmannian $Gr(2,4)$ of $P^1$'s in $P^3$, in the ambient space $P^5$.




The object numericalHilbertFunction is a method function with options.