RandomRationalPoints : Index
-
BruteForce -- values for the option Strategy when calling randomPoints
-
Codimension -- an option to specify the codimension so as not to compute it
-
Default -- values for the option Strategy when calling randomPoints
-
ExtendField -- an option used to specify if extending the finite field is permissable here
-
extendIdealByNonZeroMinor -- extends the ideal to aid finding singular locus
-
extendIdealByNonZeroMinor(...,Codimension=>...) -- an option to specify the codimension so as not to compute it
-
extendIdealByNonZeroMinor(...,ExtendField=>...) -- an option used to specify if extending the finite field is permissable here
-
extendIdealByNonZeroMinor(...,Homogeneous=>...) -- extends the ideal to aid finding singular locus
-
extendIdealByNonZeroMinor(...,IntersectionAttempts=>...) -- an option which controls how many linear intersections are attempted when looking for rational points
-
extendIdealByNonZeroMinor(...,MaxCoordinatesToReplace=>...) -- The maximum number of coordinates to turn into non-monomial functions when calling {\tt randomCoordinateChange}
-
extendIdealByNonZeroMinor(...,MaxCoordinatesToTrivialize=>...) -- the number of coordinates to set to random values when doing a linear intersection
-
extendIdealByNonZeroMinor(...,MinorPointAttempts=>...) -- extends the ideal to aid finding singular locus
-
extendIdealByNonZeroMinor(...,NumThreadsToUse=>...) -- number of threads the the function will use in a brute force search for a point
-
extendIdealByNonZeroMinor(...,PointCheckAttempts=>...) -- Number of times the the function will search for a point
-
extendIdealByNonZeroMinor(...,ProjectionAttempts=>...) -- Number of projection trials using in randomPoints when doing generic projection
-
extendIdealByNonZeroMinor(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms or binomials
-
extendIdealByNonZeroMinor(...,Strategy=>...) -- values for the option Strategy when calling randomPoints
-
extendIdealByNonZeroMinor(ZZ,Matrix,Ideal) -- extends the ideal to aid finding singular locus
-
findANonZeroMinor -- finds a non-vanishing minor at some randomly chosen point
-
findANonZeroMinor(...,Codimension=>...) -- an option to specify the codimension so as not to compute it
-
findANonZeroMinor(...,ExtendField=>...) -- an option used to specify if extending the finite field is permissable here
-
findANonZeroMinor(...,Homogeneous=>...) -- finds a non-vanishing minor at some randomly chosen point
-
findANonZeroMinor(...,IntersectionAttempts=>...) -- an option which controls how many linear intersections are attempted when looking for rational points
-
findANonZeroMinor(...,MaxCoordinatesToReplace=>...) -- The maximum number of coordinates to turn into non-monomial functions when calling {\tt randomCoordinateChange}
-
findANonZeroMinor(...,MaxCoordinatesToTrivialize=>...) -- the number of coordinates to set to random values when doing a linear intersection
-
findANonZeroMinor(...,MinorPointAttempts=>...) -- finds a non-vanishing minor at some randomly chosen point
-
findANonZeroMinor(...,NumThreadsToUse=>...) -- number of threads the the function will use in a brute force search for a point
-
findANonZeroMinor(...,PointCheckAttempts=>...) -- Number of times the the function will search for a point
-
findANonZeroMinor(...,ProjectionAttempts=>...) -- Number of projection trials using in randomPoints when doing generic projection
-
findANonZeroMinor(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms or binomials
-
findANonZeroMinor(...,Strategy=>...) -- values for the option Strategy when calling randomPoints
-
findANonZeroMinor(...,Verbose=>...) -- finds a non-vanishing minor at some randomly chosen point
-
findANonZeroMinor(ZZ,Matrix,Ideal) -- finds a non-vanishing minor at some randomly chosen point
-
Full -- When changing coordinates, whether to replace variables by general degre 1 forms or binomials
-
GenericProjection -- values for the option Strategy when calling randomPoints
-
genericProjection -- finds a random (somewhat) generic projection of the ring or ideal
-
genericProjection(...,Homogeneous=>...) -- finds a random (somewhat) generic projection of the ring or ideal
-
genericProjection(...,MaxCoordinatesToReplace=>...) -- The maximum number of coordinates to turn into non-monomial functions when calling {\tt randomCoordinateChange}
-
genericProjection(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms or binomials
-
genericProjection(...,Verbose=>...) -- turns out Verbose (debugging) output
-
genericProjection(Ideal) -- finds a random (somewhat) generic projection of the ring or ideal
-
genericProjection(Ring) -- finds a random (somewhat) generic projection of the ring or ideal
-
genericProjection(ZZ,Ideal) -- finds a random (somewhat) generic projection of the ring or ideal
-
genericProjection(ZZ,Ring) -- finds a random (somewhat) generic projection of the ring or ideal
-
getRandomLinearForms -- retrieve a list of random degree 1 and 0 forms of specified types
-
getRandomLinearForms(...,Homogeneous=>...) -- retrieve a list of random degree 1 and 0 forms of specified types
-
getRandomLinearForms(...,Verbose=>...) -- retrieve a list of random degree 1 and 0 forms of specified types
-
getRandomLinearForms(...,Verify=>...) -- retrieve a list of random degree 1 and 0 forms of specified types
-
getRandomLinearForms(Ring,List) -- retrieve a list of random degree 1 and 0 forms of specified types
-
HybridProjectionIntersection -- values for the option Strategy when calling randomPoints
-
IntersectionAttempts -- an option which controls how many linear intersections are attempted when looking for rational points
-
LinearIntersection -- values for the option Strategy when calling randomPoints
-
MaxCoordinatesToReplace -- The maximum number of coordinates to turn into non-monomial functions when calling {\tt randomCoordinateChange}
-
MaxCoordinatesToTrivialize -- the number of coordinates to set to random values when doing a linear intersection
-
MinorPointAttempts -- finds a non-vanishing minor at some randomly chosen point
-
NumThreadsToUse -- number of threads the the function will use in a brute force search for a point
-
PointCheckAttempts -- Number of times the the function will search for a point
-
ProjectionAttempts -- Number of projection trials using in randomPoints when doing generic projection
-
projectionToHypersurface -- Generic projection to a hypersurface
-
projectionToHypersurface(...,Codimension=>...) -- Generic projection to a hypersurface
-
projectionToHypersurface(...,MaxCoordinatesToReplace=>...) -- The maximum number of coordinates to turn into non-monomial functions when calling {\tt randomCoordinateChange}
-
projectionToHypersurface(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms or binomials
-
projectionToHypersurface(...,Verbose=>...) -- turns out Verbose (debugging) output
-
projectionToHypersurface(Ideal) -- Generic projection to a hypersurface
-
projectionToHypersurface(Ring) -- Generic projection to a hypersurface
-
randomCoordinateChange -- produce linear automorphism of the ring
-
randomCoordinateChange(...,Homogeneous=>...) -- produce linear automorphism of the ring
-
randomCoordinateChange(...,MaxCoordinatesToReplace=>...) -- The maximum number of coordinates to turn into non-monomial functions when calling {\tt randomCoordinateChange}
-
randomCoordinateChange(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms or binomials
-
randomCoordinateChange(...,Verbose=>...) -- turns out Verbose (debugging) output
-
randomCoordinateChange(Ring) -- produce linear automorphism of the ring
-
randomPoints -- a function to find random points in a variety.
-
randomPoints(...,Codimension=>...) -- a function to find random points in a variety.
-
randomPoints(...,ExtendField=>...) -- an option used to specify if extending the finite field is permissable here
-
randomPoints(...,Homogeneous=>...) -- a function to find random points in a variety.
-
randomPoints(...,IntersectionAttempts=>...) -- an option which controls how many linear intersections are attempted when looking for rational points
-
randomPoints(...,MaxCoordinatesToReplace=>...) -- The maximum number of coordinates to turn into non-monomial functions when calling {\tt randomCoordinateChange}
-
randomPoints(...,MaxCoordinatesToTrivialize=>...) -- the number of coordinates to set to random values when doing a linear intersection
-
randomPoints(...,NumThreadsToUse=>...) -- number of threads the the function will use in a brute force search for a point
-
randomPoints(...,PointCheckAttempts=>...) -- Number of times the the function will search for a point
-
randomPoints(...,ProjectionAttempts=>...) -- Number of projection trials using in randomPoints when doing generic projection
-
randomPoints(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms or binomials
-
randomPoints(...,Strategy=>...) -- values for the option Strategy when calling randomPoints
-
randomPoints(...,Verbose=>...) -- turns out Verbose (debugging) output
-
randomPoints(Ideal) -- a function to find random points in a variety.
-
randomPoints(ZZ,Ideal) -- a function to find random points in a variety.
-
randomPointViaLinearIntersection(...,Codimension=>...) -- an option to specify the codimension so as not to compute it
-
RandomRationalPoints -- Obtain random points in a variety
-
Replacement -- When changing coordinates, whether to replace variables by general degre 1 forms or binomials