Problems with nfhilbert() in CVS (pari 2.2.2)

[Martin Aumueller <ma@reserv.at>]

Hi!

When using nfhilbert() in the local case for a prime dividing 2 I
discovered the following two types of problems:

To trigger the first kind I type this into gp:

	nf=nfinit(X^2+1)
	nfhilbert(nf,[1,-2]~,[1,-2]~,idealprimedec(nf,2)[1])

I get this:

	  ***   the PARI stack overflows !
	  current stack size: 4000000 (3.815 Mbytes)
	  [hint] you can increase GP stack with allocatemem()

Now I continue:

	allocatemem(300000000);
	nfhilbert(nf,[1,-2]~,[1,-2]~,idealprimedec(nf,2)[1])

The answer is:

	  ***   bug in GP (Segmentation Fault), please report


And the second kind of problem is seen when typing:

	nf=nfinit(X^2+3)
	nfhilbert(nf,[3,0]~,[3,0]~,idealprimedec(nf,2)[1])

But now pari says to me:

	  ***   [Mod(3, X^2 + 3), 0]~ not a nfelt.


I checked the above with today's pari 2.2.2 from CVS. I didn't yet
have the time to explore this any further, but as soon as I do I
will have a closer look. But perhaps someone is more familiar
with the code to come up with a quick solution.

Sincerely,
	Martin