extreme case of polredabs()

[Igor Schein <igor@txc.com>]

Hi,

Let P(p)=Pol([1,0,p^2,0,p^2]), where p is prime.  
If omega(poldisc(P(p))/nfdisc(P(p))) is 3, then smallvectors portions
of polredabs(P(p)) takes very long time.  Illustration: 

? gettime;for(k=2,10!,p=2^k;while(1,p=nextprime(p+1);pol=Pol([1,0,p^2,0,p^2]);if(omega(poldisc(pol)/nfdisc(pol))==3,print1(p" ");polredabs(pol);print(gettime);break)))
7 10
11 10
23 10
43 10
73 20
137 10
263 10
523 30
1031 40
2063 50
4111 100
8219 210
16417 520
32771 780
65557 3040
131101 3460
262217 7030
524369 14130
1048583 28700
2097169 82080

Thanks

Igor