FThresholds : Index
- Attempts (missing documentation) -- generates an inhomogeneous system of parameters
- binaryFormFPT -- computes the F-pure threshold of a form in two variables
- binaryFormFPT(List,List) -- computes the F-pure threshold of a form in two variables
- binaryFormFPT(RingElement) -- computes the F-pure threshold of a form in two variables
- BinaryRecursive -- an option value specifying a binary recursive search method
- binomialFPT -- computes the F-pure threshold of a binomial polynomial
- compareFPT -- checks whether a given number is less than, greater than, or equal to the F-pure threshold
- compareFPT(..., AssumeDomain => ...) -- checks whether a given number is less than, greater than, or equal to the F-pure threshold
- compareFPT(..., FrobeniusRootStrategy => ...) -- checks whether a given number is less than, greater than, or equal to the F-pure threshold
- compareFPT(..., MaxCartierIndex => ...) -- checks whether a given number is less than, greater than, or equal to the F-pure threshold
- compareFPT(..., QGorensteinIndex => ...) -- checks whether a given number is less than, greater than, or equal to the F-pure threshold
- compareFPT(Number,RingElement) -- checks whether a given number is less than, greater than, or equal to the F-pure threshold
- ComputePreviousNus -- an option to compute nu-values recursively
- ContainmentTest -- an option to specify the containment test used
- criticalExponentApproximation -- gives a list of approximates of a critical exponent
- criticalExponentApproximation(ZZ,Ideal,Ideal) -- gives a list of approximates of a critical exponent
- criticalExponentApproximation(ZZ,RingElement,Ideal) -- gives a list of approximates of a critical exponent
- diagonalFPT -- computes the F-pure threshold of a diagonal polynomial
- fpt -- attempts to compute the F-pure threshold of a polynomial at the origin
- fpt(..., DepthOfSearch => ...) -- attempts to compute the F-pure threshold of a polynomial at the origin
- fpt(..., FRegularityCheck => ...) -- attempts to compute the F-pure threshold of a polynomial at the origin
- fpt(..., MaxChecks => ...) -- attempts to compute the F-pure threshold of a polynomial at the origin
- fpt(..., UseFSignature => ...) -- attempts to compute the F-pure threshold of a polynomial at the origin
- fpt(..., UseSpecialAlgorithms => ...) -- attempts to compute the F-pure threshold of a polynomial at the origin
- fpt(..., Verbose => ...) -- attempts to compute the F-pure threshold of a polynomial at the origin
- fpt(RingElement) -- attempts to compute the F-pure threshold of a polynomial at the origin
- fptApproximation -- gives a list of terms in the sequence whose limit defines the F-pure threshold
- fptApproximation(ZZ,Ideal) -- gives a list of terms in the sequence whose limit defines the F-pure threshold
- fptApproximation(ZZ,RingElement) -- gives a list of terms in the sequence whose limit defines the F-pure threshold
- FRegularityCheck -- an option to use an F-regularity check to find an F-pure threshold
- FrobeniusPower -- an option value to consider containment of Frobenius powers of ideals
- FrobeniusRoot -- an option value to consider containment of Frobenius roots of ideals
- ftApproximation -- gives a list of terms in the sequence whose limit defines an F-threshold
- ftApproximation(ZZ,Ideal,Ideal) -- gives a list of terms in the sequence whose limit defines an F-threshold
- ftApproximation(ZZ,RingElement,Ideal) -- gives a list of terms in the sequence whose limit defines an F-threshold
- FThresholds -- a package for computing numerical invariants in prime characteristic
- isBinomial -- Checks whether a polynomial is binomial.
- isDiagonal -- Checks whether a polynomial is diagonal.
- isFJumpingExponent -- Checks whether a given number is an F-jumping number
- isFJumpingExponent(..., AssumeDomain => ...) -- Checks whether a given number is an F-jumping number
- isFJumpingExponent(..., FrobeniusRootStrategy => ...) -- Checks whether a given number is an F-jumping number
- isFJumpingExponent(..., MaxCartierIndex => ...) -- Checks whether a given number is an F-jumping number
- isFJumpingExponent(..., QGorensteinIndex => ...) -- Checks whether a given number is an F-jumping number
- isFJumpingExponent(Number,RingElement) -- Checks whether a given number is an F-jumping number
- isFPT -- Checks whether a given number is the F-pure threshold
- isFPT(..., AssumeDomain => ...) -- Checks whether a given number is the F-pure threshold
- isFPT(..., FrobeniusRootStrategy => ...) -- Checks whether a given number is the F-pure threshold
- isFPT(..., MaxCartierIndex => ...) -- Checks whether a given number is the F-pure threshold
- isFPT(..., QGorensteinIndex => ...) -- Checks whether a given number is the F-pure threshold
- isFPT(Number,RingElement) -- Checks whether a given number is the F-pure threshold
- MaxChecks -- specifies the number of "guess and check" attempts to make in an F-pure threshold computation
- mu -- computes the largest Frobenius power of an ideal not contained in a specified Frobenius power
- mu(..., ComputePreviousNus => ...) -- computes the largest Frobenius power of an ideal not contained in a specified Frobenius power
- mu(..., Search => ...) -- computes the largest Frobenius power of an ideal not contained in a specified Frobenius power
- mu(..., UseColonIdeals => ...) -- computes the largest Frobenius power of an ideal not contained in a specified Frobenius power
- mu(ZZ,Ideal) -- computes the largest Frobenius power of an ideal not contained in a specified Frobenius power
- mu(ZZ,Ideal,Ideal) -- computes the largest Frobenius power of an ideal not contained in a specified Frobenius power
- mu(ZZ,RingElement) -- computes the largest Frobenius power of an ideal not contained in a specified Frobenius power
- mu(ZZ,RingElement,Ideal) -- computes the largest Frobenius power of an ideal not contained in a specified Frobenius power
- muList -- computes a list of mu-values associated to a given F-threshold or F-pure threshold
- muList(..., Search => ...) -- computes a list of mu-values associated to a given F-threshold or F-pure threshold
- muList(..., UseColonIdeals => ...) -- computes a list of mu-values associated to a given F-threshold or F-pure threshold
- muList(ZZ,Ideal) -- computes a list of mu-values associated to a given F-threshold or F-pure threshold
- muList(ZZ,Ideal,Ideal) -- computes a list of mu-values associated to a given F-threshold or F-pure threshold
- muList(ZZ,RingElement) -- computes a list of mu-values associated to a given F-threshold or F-pure threshold
- muList(ZZ,RingElement,Ideal) -- computes a list of mu-values associated to a given F-threshold or F-pure threshold
- nu -- computes the largest power of an ideal not contained in a specified Frobenius power
- nu(..., ComputePreviousNus => ...) -- computes the largest power of an ideal not contained in a specified Frobenius power
- nu(..., ContainmentTest => ...) -- computes the largest power of an ideal not contained in a specified Frobenius power
- nu(..., Search => ...) -- computes the largest power of an ideal not contained in a specified Frobenius power
- nu(..., UseColonIdeals => ...) -- computes the largest power of an ideal not contained in a specified Frobenius power
- nu(ZZ,Ideal) -- computes the largest power of an ideal not contained in a specified Frobenius power
- nu(ZZ,Ideal,Ideal) -- computes the largest power of an ideal not contained in a specified Frobenius power
- nu(ZZ,RingElement) -- computes the largest power of an ideal not contained in a specified Frobenius power
- nu(ZZ,RingElement,Ideal) -- computes the largest power of an ideal not contained in a specified Frobenius power
- nuList -- computes a list of nu-values associated to a given F-threshold or F-pure threshold
- nuList(..., ContainmentTest => ...) -- computes a list of nu-values associated to a given F-threshold or F-pure threshold
- nuList(..., Search => ...) -- computes a list of nu-values associated to a given F-threshold or F-pure threshold
- nuList(..., UseColonIdeals => ...) -- computes a list of nu-values associated to a given F-threshold or F-pure threshold
- nuList(ZZ,Ideal) -- computes a list of nu-values associated to a given F-threshold or F-pure threshold
- nuList(ZZ,Ideal,Ideal) -- computes a list of nu-values associated to a given F-threshold or F-pure threshold
- nuList(ZZ,RingElement) -- computes a list of nu-values associated to a given F-threshold or F-pure threshold
- nuList(ZZ,RingElement,Ideal) -- computes a list of nu-values associated to a given F-threshold or F-pure threshold
- Search -- an option to specify the search method
- StandardPower -- an option value to consider containment of standard power of an ideal in Frobenius power of another ideal
- UseColonIdeals -- an option to use colon ideals to compute nus in an iterative way
- UseFSignature -- whether to use the F-signature function in the search for an F-pure threshold
- UseSpecialAlgorithms -- an option to check whether the input is a diagonal polynomial, binomial, or binary form