RandomPoints : Index

• BruteForce -- values for the option Strategy when calling randomPoints
• Codimension -- Generic projection to a hypersurface
• DecompositionStrategy -- control how ideals of points are factored into minimal primes
• Default -- values for the option Strategy when calling randomPoints
• DimensionFunction -- an option for specifying custom dimension functions
• DimensionIntersectionAttempts -- computes the dimension of the given ideal $I$ probabilistically
• dimViaBezout -- computes the dimension of the given ideal $I$ probabilistically
• dimViaBezout(...,DimensionIntersectionAttempts=>...) -- computes the dimension of the given ideal $I$ probabilistically
• dimViaBezout(...,Homogeneous=>...) -- computes the dimension of the given ideal $I$ probabilistically
• dimViaBezout(...,MinimumFieldSize=>...) -- computes the dimension of the given ideal $I$ probabilistically
• dimViaBezout(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms, binomials, etc.
• dimViaBezout(...,Verbose=>...) -- computes the dimension of the given ideal $I$ probabilistically
• dimViaBezout(Ideal) -- computes the dimension of the given ideal $I$ probabilistically
• ExtendField -- an option used to specify if extending the finite field is permissible here
• extendIdealByNonZeroMinor -- extends the ideal to aid finding singular locus
• extendIdealByNonZeroMinor(...,DecompositionStrategy=>...) -- control how ideals of points are factored into minimal primes
• extendIdealByNonZeroMinor(...,DimensionFunction=>...) -- extends the ideal to aid finding singular locus
• extendIdealByNonZeroMinor(...,ExtendField=>...) -- an option used to specify if extending the finite field is permissible here
• extendIdealByNonZeroMinor(...,Homogeneous=>...) -- extends the ideal to aid finding singular locus
• 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(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms, binomials, etc.
• extendIdealByNonZeroMinor(...,Strategy=>...) -- values for the option Strategy when calling randomPoints
• extendIdealByNonZeroMinor(...,Verbose=>...) -- extends the ideal to aid finding singular locus
• extendIdealByNonZeroMinor(ZZ,Matrix,Ideal) -- extends the ideal to aid finding singular locus
• findANonZeroMinor -- finds a non-vanishing minor at some randomly chosen point
• findANonZeroMinor(...,DecompositionStrategy=>...) -- control how ideals of points are factored into minimal primes
• findANonZeroMinor(...,DimensionFunction=>...) -- finds a non-vanishing minor at some randomly chosen point
• findANonZeroMinor(...,ExtendField=>...) -- an option used to specify if extending the finite field is permissible here
• findANonZeroMinor(...,Homogeneous=>...) -- finds a non-vanishing minor at some randomly chosen point
• 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(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms, binomials, etc.
• 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, binomials, etc.
• 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, binomials, etc.
• 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
• 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}
• MinimumFieldSize -- computes the dimension of the given ideal $I$ probabilistically
• MinorPointAttempts -- finds a non-vanishing minor at some randomly chosen point
• MultiplicationTable -- values for the option Strategy when calling randomPoints
• 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
• projectionToHypersurface -- Generic projection to a hypersurface
• projectionToHypersurface(...,Codimension=>...) -- Generic projection to a hypersurface
• projectionToHypersurface(...,Homogeneous=>...) -- 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, binomials, etc.
• 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, binomials, etc.
• randomCoordinateChange(...,Verbose=>...) -- turns out Verbose (debugging) output
• randomCoordinateChange(Ring) -- produce linear automorphism of the ring
• RandomPoints -- Obtain random points in a variety
• randomPoints -- a function to find random points in a variety.
• randomPoints(...,DecompositionStrategy=>...) -- control how ideals of points are factored into minimal primes
• randomPoints(...,DimensionFunction=>...) -- a function to find random points in a variety.
• randomPoints(...,ExtendField=>...) -- an option used to specify if extending the finite field is permissible here
• randomPoints(...,Homogeneous=>...) -- a function to find random points in a variety.
• 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(...,Replacement=>...) -- When changing coordinates, whether to replace variables by general degre 1 forms, binomials, etc.
• 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.
• Replacement -- When changing coordinates, whether to replace variables by general degre 1 forms, binomials, etc.
• Trinomial -- When changing coordinates, whether to replace variables by general degre 1 forms, binomials, etc.