New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add is_polynomial and normal_form to projective morphism #20650
Comments
Branch: u/rlmiller/polynomials |
Commit: |
New commits:
|
comment:5
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Changed branch from u/rlmiller/polynomials to u/bhutz/polynomials |
comment:9
I did some code clean-up. No functionality was changed except that instead of having to compute the inverses of the conjugation it now just computes the right one to start with. There are still a few functionality issues: Other base rings that should work do not such as QQ
I think it likely these will work for finite fields as well
Function field base rings are not going to work, but this error isn't very informative
The single rational preimage check is not sufficient
New commits:
|
Reviewer: Ben Hutz |
comment:10
One more thing: in dimension > 1 it should return a NotImplmentedError |
Changed branch from u/bhutz/polynomials to u/rlmiller/polynomials |
New commits:
|
Changed branch from u/rlmiller/polynomials to u/bhutz/polynomials |
comment:14
Going all the way to the splitting field was causing some slow performance, so I've reworked it to manage the fields directly. This includes special casing finite fields and managing the embeddings as well. it should be noted that a simple error in projective_morphism.conjugation() was corrected in this ticket as well as a simple error in affine_morphism.homogenize() The new version is ready for review now. New commits:
|
Changed author from Rebecca Lauren Miller to Rebecca Lauren Miller, Ben Hutz |
Changed reviewer from Ben Hutz to Ben Hutz, Rebecca Lauren Miller |
Changed branch from u/bhutz/polynomials to |
Added function to determine whether an equation is a polynomial or not by checking if it has a totally ramified fixed point. (is_polynomial)
Then used this function to create make_look_poly, which puts polynomials in the form "xn + a*x(n-2) +...+c", where a and c are constants.
Needs more examples, specifically for errors.
CC: @bhutz
Component: algebraic geometry
Author: Rebecca Lauren Miller, Ben Hutz
Branch/Commit:
2da7679
Reviewer: Ben Hutz, Rebecca Lauren Miller
Issue created by migration from https://trac.sagemath.org/ticket/20650
The text was updated successfully, but these errors were encountered: