FrobeniusThresholds : Table of Contents

• FrobeniusThresholds -- a package for computing F-pure thresholds and related invariants
• Bounds -- an option for the function fpt specifying lower and upper bounds for the F-pure threshold
• compareFPT -- determine whether a number is less than, greater than, or equal to the F-pure threshold
• ContainmentTest -- an option for the function frobeniusNu specifying the type of containment of powers of ideals to test
• FinalAttempt -- an option for the function fpt to perform a final check attempting find an F-pure threshold
• fpt -- attempt to compute the F-pure threshold of a polynomial at the origin or globally
• frobeniusNu -- computes the largest power of an ideal not contained in a specified Frobenius power
• FrobeniusPower -- a valid value for the option ContainmentTest
• FrobeniusRoot -- a valid value for the option ContainmentTest
• GlobalFrobeniusRoot -- a valid value for the option ContainmentTest
• GuessStrategy -- an option for the function fpt to specify the criterion used for selecting numbers to check
• isFJumpingExponent -- whether a given number is an F-jumping exponent
• isFPT -- checks whether a given rational number is the F-pure threshold
• isSimpleNormalCrossing -- whether a polynomial is a product of factors that are in simple normal crossing
• ReturnList -- an option for the function frobeniusNu to return a list of successive nu values
• Search -- an option for the function frobeniusNu to specify the search method for testing containments of powers of ideals
• StandardPower -- a valid value for the option ContainmentTest
• UseSpecialAlgorithms -- an option for the functions fpt and frobeniusNu to use special algorithms to speed up computations