#6296: linbox minpoly over small finite fields is TOTALLY BROKEN
----------------------------+-----------------------------------------------
Reporter: was | Owner: was
Type: defect | Status: new
Priority: critical | Milestone: sage-4.0.2
Component: linear algebra | Keywords:
Reviewer: | Author:
Merged: |
----------------------------+-----------------------------------------------
{{{
On Wed, Jun 10, 2009 at 6:03 PM, Yann<[email protected]> wrote:
>
> ----------------------------------------------------------------------
> | Sage Version 4.0.1, Release Date: 2009-06-06 |
> | Type notebook() for the GUI, and license() for information. |
> ----------------------------------------------------------------------
> sage: A=matrix(GF(3),2,[0,0,1,2])
> sage: R.<x>=GF(3)[]
> sage: D={ x:0 , x+1:0 , x^2+x:0 }
> sage: for i in range(100000):
> ....: D[A._minpoly_linbox()]+=1
> ....:
> sage: D
> {x: 38266, x + 1: 29397, x^2 + x: 32337}
>
You're absolutely right! This *sucks* -- it seems like nothing we have
ever wrapped in Linbox is right at first. Hopefully the issue is that
somehow the algorithm is only supposed to be probabilistic, and we're just
misusing it in sage (quite possible).
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6296>
Sage <http://sagemath.org/>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
