randomPoint(I)
randomPoint(I,Sa)
randomPoint(I,Ms)
Given an ideal in a polynomial ring over a finite field, this procedure computes, if possible, a rational point in the corresponding variety. We proceed by intersecting with random hyperplanes down to a set of points and repeat this until we find a rational point (if existing). If an additional polynomial ring is indicated, then we compute a point in this ring, if possible. If the ideal $I$ is just the complete intersection of the Pfaffian relations from our construction, then we can use the corresponding skew-symmetric matrices from the list Ms to cut down to some linear subspaces which may speed up the computation. If the ideal $I$ defines an empty vanishing locus, an error message is printed.
|
|
|
|
|
|
|
|
The object randomPoint is a method function.