Probably not a bug in some sense. The kronecker factoring code uses an
exponential (in the degree) amount of time and space. So the bind stack
does probably need to be larger for some examples.
RJF
> -----Original Message-----
> From: maxima-bounces at math.utexas.edu [mailto:maxima-
> bounces at math.utexas.edu] On Behalf Of Barton Willis
> Sent: Saturday, February 03, 2007 1:22 PM
> To: Raymond Toy
> Cc: maxima list; Robert Dodier
> Subject: Re: [Maxima] bind stack overflow factoring 7th degree poly
>
> The Kronecker factor code is *very* slow, and it seems to share
> with the Berlekamp factor code a similar bug:
>
> (%i1) e : apply("*", makelist(x + k,k,1,15))$
> (%i2) e : expand(e)$
>
> (%i3) factor(e),berlefact : false;
> Maxima encountered a Lisp error:
> Error in MACSYMA-TOP-LEVEL [or a callee]: Bind stack overflow.
>
> (%i4) factor(e),berlefact : true;
> (%o4)
> (x+1)*(x+2)*(x+3)*(x+4)*(x+5)*(x+6)*(x+7)*(x+8)*(x+9)*(x+10)*(x+11)*(x+12)
> *(x+13)*(x+14)*(x+15)
>
>
> Barton
>
> _______________________________________________
> Maxima mailing list
> Maxima at math.utexas.edu
> http://www.math.utexas.edu/mailman/listinfo/maxima