Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Implement _is_irreducible_univariate_polynomial for other base rings #23202

Open
roed314 opened this issue Jun 9, 2017 · 0 comments
Open

Implement _is_irreducible_univariate_polynomial for other base rings #23202

roed314 opened this issue Jun 9, 2017 · 0 comments
Labels
c: algebra p: major / 3 t: enhancement

Comments

@roed314
Copy link
Contributor

roed314 commented Jun 9, 2017

#23168 introduced a method where base rings can define a method to compute irreducibility for polynomials over themselves (most useful for algebraically closed fields). That ticket just implemented this for QQbar as an example, but more fields should do so.

Component: algebra

Keywords: sd86.5

Issue created by migration from https://trac.sagemath.org/ticket/23202
@roed314 roed314 added this to the sage-8.0 milestone Jun 9, 2017
@mkoeppe mkoeppe removed this from the sage-8.0 milestone Dec 29, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
c: algebra p: major / 3 t: enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@roed314 @mkoeppe