Re: formal ellinit

[Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr>]

On Tue, Jun 12, 2012 at 11:53:40PM +0200, Karim Belabas wrote:
> * Bill Allombert [2012-06-11 14:06]:
> > Dear PARI developers,
> > 
> > I found a way to do a formal ellinit which is sometimes useful:
> > 
> > ? a6;a4;a3;a2;a1;E=ellinit([a1,a2,a3,a4,a6],1);
> > ? ##
> >   ***   last result computed in 0 ms.
> > 
> > This is useful because the more straightforward
> > a1;a2;a3;a4;a6;ellinit([a1,a2,a3,a4,a6],1);
> > does not really work (much much slower).
> 
> I committed a workaround for the original problem in master:

This is very useful, thanks.
However your work around only seems to work in char 0, 2 and 3.

? E=ellinit([a1,a2,a3,a4,a6]*Mod(1,5))
  *** ellinit: the PARI stack overflows !
  current stack size: 32000000 (30.518 Mbytes)

Cheers,
Bill.