Hi Joel,
Well done on annihilating singular on the horror example you had. I've
sat down to read the code a few times, but it is slow going for me, as
I don't speak python well yet. But I'll make a few comments when I do
get some spare moments to finish reading your code. That'll probably
be
On Feb 18, 6:21 am, Bill Hart [EMAIL PROTECTED] wrote:
Laurent Bernardin and Michael B. Monagan.
Efficient Multivariate Factorization Over Finite Fields.
If Sage has or can get fast LLL you should implement the new algorithm
of Mark van Hoeij.
On Feb 18, 2008 10:08 AM, Roman Pearce [EMAIL PROTECTED] wrote:
On Feb 18, 6:21 am, Bill Hart [EMAIL PROTECTED] wrote:
Laurent Bernardin and Michael B. Monagan.
Efficient Multivariate Factorization Over Finite Fields.
If Sage has or can get fast LLL you should implement the new algorithm
Mark uses LLL to solve the knapsack problem that arises from solving
how the local factors should be bundled together to reconstruct the
global factors. It's only used to tame the combinatorial explosion
that you get if there are many local factors, but only very few global
ones.
This is
However, I don't know of any new (or old) algorithm by Mark van Hoeij
that addresses the problem of Efficient Multivariate Factorization Over
Finite Fields using LLL. Could you please clarify.
I am aware of Mark's algorithms for univariate polynomial factorization
over global fields using
Apparently van Hoeij's approach works (very well) for bivariate
polynomials over ZZ. The Magma documentation doesn't seem to give any
clue as to whether they use a van Hoeij like approach for finite
fields. I at least cannot see how such a thing would work.
I did sit down and browse the paper I
