This repository has been archived by the owner on Jan 30, 2023. It is now read-only.
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Introduce a caching function universal_discriminant.
This approach of using a separate function to compute universal discriminants was suggested by both John Cremona and Peter Bruin. This implementation does not call Polynomial.discriminant, which has the benefit that it may be called by that method without causing an infinite loop and without need for an extra argument for algorithm selection. Another benefit is that the special case for zero divisors can be avoided, as can be the polynomial quotient field. I chose to implement this function in the polynomial_element module, but John suggested placing it in invariant_theory, so I'd like to document this alternative suggestion here.
- Loading branch information
Showing
1 changed file
with
46 additions
and
17 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters