Line data Source code
1 : /* Copyright (C) 2000 The PARI group.
2 :
3 : This file is part of the PARI/GP package.
4 :
5 : PARI/GP is free software; you can redistribute it and/or modify it under the
6 : terms of the GNU General Public License as published by the Free Software
7 : Foundation; either version 2 of the License, or (at your option) any later
8 : version. It is distributed in the hope that it will be useful, but WITHOUT
9 : ANY WARRANTY WHATSOEVER.
10 :
11 : Check the License for details. You should have received a copy of it, along
12 : with the package; see the file 'COPYING'. If not, write to the Free Software
13 : Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */
14 : #include "pari.h"
15 : #include "paripriv.h"
16 :
17 : #define DEBUGLEVEL DEBUGLEVEL_bnf
18 :
19 : /*******************************************************************/
20 : /* */
21 : /* CLASS GROUP AND REGULATOR (McCURLEY, BUCHMANN) */
22 : /* GENERAL NUMBER FIELDS */
23 : /* */
24 : /*******************************************************************/
25 : /* get_random_ideal */
26 : static const long RANDOM_BITS = 4;
27 : /* Buchall */
28 : static const long RELSUP = 5;
29 : static const long FAIL_DIVISOR = 32;
30 : static const long MINFAIL = 10;
31 : /* small_norm */
32 : static const long BNF_RELPID = 4;
33 : static const long maxtry_FACT = 500;
34 : /* rnd_rel */
35 : static const long RND_REL_RELPID = 1;
36 : /* random relations */
37 : static const long MINSFB = 3;
38 : static const long SFB_MAX = 3;
39 : static const long DEPSIZESFBMULT = 16;
40 : static const long DEPSFBDIV = 10;
41 : /* add_rel_i */
42 : static const ulong mod_p = 27449UL;
43 : /* be_honest */
44 : static const long maxtry_HONEST = 50;
45 :
46 : typedef struct FACT {
47 : long pr, ex;
48 : } FACT;
49 :
50 : typedef struct subFB_t {
51 : GEN subFB;
52 : struct subFB_t *old;
53 : } subFB_t;
54 :
55 : /* a factor base contains only noninert primes
56 : * KC = # of P in factor base (p <= n, NP <= n2)
57 : * KC2= # of P assumed to generate class group (NP <= n2)
58 : *
59 : * KCZ = # of rational primes under ideals counted by KC
60 : * KCZ2= same for KC2 */
61 :
62 : typedef struct FB_t {
63 : GEN FB; /* FB[i] = i-th rational prime used in factor base */
64 : GEN LP; /* vector of all prime ideals in FB, by increasing norm */
65 : GEN LV; /* LV[p] = vector of P|p, NP <= n2
66 : * isclone() is set for LV[p] iff all P|p are in FB
67 : * LV[i], i not prime or i > n2, is undefined! */
68 : GEN iLP; /* iLP[p] = i such that LV[p] = [LP[i],...] */
69 : GEN L_jid; /* indexes of "useful" prime ideals for rnd_rel */
70 : long KC, KCZ, KCZ2;
71 : GEN prodZ; /* product of the primes in KCZ*/
72 : GEN subFB; /* LP o subFB = part of FB used to build random relations */
73 : int sfb_chg; /* need to change subFB ? */
74 : GEN perm; /* permutation of LP used to represent relations [updated by
75 : hnfspec/hnfadd: dense rows come first] */
76 : GEN idealperm; /* permutation of ideals under field automorphisms */
77 : GEN minidx; /* minidx[i] min ideal in orbit of LP[i] under field autom */
78 : subFB_t *allsubFB; /* all subFB's used */
79 : GEN embperm; /* permutations of the complex embeddings */
80 : long MAXDEPSIZESFB; /* # trials before increasing subFB */
81 : long MAXDEPSFB; /* MAXDEPSIZESFB / DEPSFBDIV, # trials befor rotating subFB */
82 : double ballvol;
83 : } FB_t;
84 :
85 : enum { sfb_CHANGE = 1, sfb_INCREASE = 2 };
86 :
87 : typedef struct REL_t {
88 : GEN R; /* relation vector as t_VECSMALL; clone */
89 : long nz; /* index of first nonzero elt in R (hash) */
90 : GEN m; /* pseudo-minimum yielding the relation; clone */
91 : long relorig; /* relation this one is an image of */
92 : long relaut; /* automorphim used to compute this relation from the original */
93 : GEN emb; /* archimedean embeddings */
94 : GEN junk[2]; /*make sure sizeof(struct) is a power of two.*/
95 : } REL_t;
96 :
97 : typedef struct RELCACHE_t {
98 : REL_t *chk; /* last checkpoint */
99 : REL_t *base; /* first rel found */
100 : REL_t *last; /* last rel found so far */
101 : REL_t *end; /* target for last relation. base <= last <= end */
102 : size_t len; /* number of rels pre-allocated in base */
103 : long relsup; /* how many linearly dependent relations we allow */
104 : GEN basis; /* mod p basis (generating family actually) */
105 : ulong missing; /* missing vectors in generating family above */
106 : } RELCACHE_t;
107 :
108 : typedef struct FP_t {
109 : double **q, *v, *y, *z;
110 : GEN x;
111 : } FP_t;
112 :
113 : static void
114 0 : wr_rel(GEN e)
115 : {
116 0 : long i, l = lg(e);
117 0 : for (i = 1; i < l; i++)
118 0 : if (e[i]) err_printf("%ld^%ld ",i,e[i]);
119 0 : }
120 : static void
121 0 : dbg_newrel(RELCACHE_t *cache)
122 : {
123 0 : if (DEBUGLEVEL > 1)
124 : {
125 0 : err_printf("\n++++ cglob = %ld\nrel = ", cache->last - cache->base);
126 0 : wr_rel(cache->last->R);
127 0 : err_printf("\n");
128 : }
129 : else
130 0 : err_printf("%ld ", cache->last - cache->base);
131 0 : }
132 :
133 : static void
134 64093 : delete_cache(RELCACHE_t *M)
135 : {
136 : REL_t *rel;
137 1056639 : for (rel = M->base+1; rel <= M->last; rel++)
138 : {
139 992546 : gunclone(rel->R);
140 992548 : if (rel->m) gunclone(rel->m);
141 : }
142 64093 : pari_free((void*)M->base); M->base = NULL;
143 64093 : }
144 :
145 : static void
146 66268 : delete_FB(FB_t *F)
147 : {
148 : subFB_t *s, *sold;
149 133299 : for (s = F->allsubFB; s; s = sold) { sold = s->old; pari_free(s); }
150 66269 : gunclone(F->minidx);
151 66270 : gunclone(F->idealperm);
152 66270 : }
153 :
154 : static void
155 64093 : reallocate(RELCACHE_t *M, long len)
156 : {
157 64093 : M->len = len;
158 64093 : if (!M->base)
159 64093 : M->base = (REL_t*)pari_malloc((len+1) * sizeof(REL_t));
160 : else
161 : {
162 0 : size_t l = M->last - M->base, c = M->chk - M->base, e = M->end - M->base;
163 0 : pari_realloc_ip((void**)&M->base, (len+1) * sizeof(REL_t));
164 0 : M->last = M->base + l;
165 0 : M->chk = M->base + c;
166 0 : M->end = M->base + e;
167 : }
168 64093 : }
169 :
170 : #define pr_get_smallp(pr) gel(pr,1)[2]
171 :
172 : /* don't take P|p all other Q|p are already there */
173 : static int
174 307631 : bad_subFB(FB_t *F, long t)
175 : {
176 307631 : GEN LP, P = gel(F->LP,t);
177 307631 : long p = pr_get_smallp(P);
178 307631 : LP = gel(F->LV,p);
179 307631 : return (isclone(LP) && t == F->iLP[p] + lg(LP)-1);
180 : }
181 :
182 : static void
183 67033 : assign_subFB(FB_t *F, GEN yes, long iyes)
184 : {
185 67033 : long i, lv = sizeof(subFB_t) + iyes*sizeof(long); /* for struct + GEN */
186 67033 : subFB_t *s = (subFB_t *)pari_malloc(lv);
187 67033 : s->subFB = (GEN)&s[1];
188 67033 : s->old = F->allsubFB; F->allsubFB = s;
189 288952 : for (i = 0; i < iyes; i++) s->subFB[i] = yes[i];
190 67033 : F->subFB = s->subFB;
191 67033 : F->MAXDEPSIZESFB = (iyes-1) * DEPSIZESFBMULT;
192 67033 : F->MAXDEPSFB = F->MAXDEPSIZESFB / DEPSFBDIV;
193 67033 : }
194 :
195 : /* Determine the permutation of the ideals made by each field automorphism */
196 : static GEN
197 66270 : FB_aut_perm(FB_t *F, GEN auts, GEN cyclic)
198 : {
199 66270 : long i, j, m, KC = F->KC, nauts = lg(auts)-1;
200 66270 : GEN minidx, perm = zero_Flm_copy(KC, nauts);
201 :
202 66270 : if (!nauts) { F->minidx = gclone(identity_zv(KC)); return cgetg(1,t_MAT); }
203 41980 : minidx = zero_Flv(KC);
204 91785 : for (m = 1; m < lg(cyclic); m++)
205 : {
206 49806 : GEN thiscyc = gel(cyclic, m);
207 49806 : long k0 = thiscyc[1];
208 49806 : GEN aut = gel(auts, k0), permk0 = gel(perm, k0), ppermk;
209 49806 : i = 1;
210 213866 : while (i <= KC)
211 : {
212 164061 : pari_sp av2 = avma;
213 164061 : GEN seen = zero_Flv(KC), P = gel(F->LP, i);
214 164061 : long imin = i, p, f, l;
215 164061 : p = pr_get_smallp(P);
216 164061 : f = pr_get_f(P);
217 : do
218 : {
219 480863 : if (++i > KC) break;
220 431059 : P = gel(F->LP, i);
221 : }
222 431059 : while (p == pr_get_smallp(P) && f == pr_get_f(P));
223 644915 : for (j = imin; j < i; j++)
224 : {
225 480862 : GEN img = ZM_ZC_mul(aut, pr_get_gen(gel(F->LP, j)));
226 1667544 : for (l = imin; l < i; l++)
227 1667542 : if (!seen[l] && ZC_prdvd(img, gel(F->LP, l)))
228 : {
229 480851 : seen[l] = 1; permk0[j] = l; break;
230 : }
231 : }
232 164053 : set_avma(av2);
233 : }
234 68992 : for (ppermk = permk0, i = 2; i < lg(thiscyc); i++)
235 : {
236 19187 : GEN permk = gel(perm, thiscyc[i]);
237 384196 : for (j = 1; j <= KC; j++) permk[j] = permk0[ppermk[j]];
238 19187 : ppermk = permk;
239 : }
240 : }
241 310343 : for (j = 1; j <= KC; j++)
242 : {
243 268364 : if (minidx[j]) continue;
244 129177 : minidx[j] = j;
245 361063 : for (i = 1; i <= nauts; i++) minidx[coeff(perm, j, i)] = j;
246 : }
247 41979 : F->minidx = gclone(minidx); return perm;
248 : }
249 :
250 : /* set subFB.
251 : * Fill F->perm (if != NULL): primes ideals sorted by increasing norm (except
252 : * the ones in subFB come first [dense rows for hnfspec]) */
253 : static void
254 66270 : subFBgen(FB_t *F, GEN auts, GEN cyclic, double PROD, long minsFB)
255 : {
256 : GEN y, perm, yes, no;
257 66270 : long i, j, k, iyes, ino, lv = F->KC + 1;
258 : double prod;
259 : pari_sp av;
260 :
261 66270 : F->LP = cgetg(lv, t_VEC);
262 66270 : F->L_jid = F->perm = cgetg(lv, t_VECSMALL);
263 66270 : av = avma;
264 66270 : y = cgetg(lv,t_COL); /* Norm P */
265 313208 : for (k=0, i=1; i <= F->KCZ; i++)
266 : {
267 246938 : GEN LP = gel(F->LV,F->FB[i]);
268 246938 : long l = lg(LP);
269 713767 : for (j = 1; j < l; j++)
270 : {
271 466829 : GEN P = gel(LP,j);
272 466829 : k++;
273 466829 : gel(y,k) = pr_norm(P);
274 466829 : gel(F->LP,k) = P;
275 : }
276 : }
277 : /* perm sorts LP by increasing norm */
278 66270 : perm = indexsort(y);
279 66270 : no = cgetg(lv, t_VECSMALL); ino = 1;
280 66270 : yes = cgetg(lv, t_VECSMALL); iyes = 1;
281 66270 : prod = 1.0;
282 303548 : for (i = 1; i < lv; i++)
283 : {
284 273567 : long t = perm[i];
285 273567 : if (bad_subFB(F, t)) { no[ino++] = t; continue; }
286 :
287 153065 : yes[iyes++] = t;
288 153065 : prod *= (double)itos(gel(y,t));
289 153065 : if (iyes > minsFB && prod > PROD) break;
290 : }
291 66270 : setlg(yes, iyes);
292 219335 : for (j=1; j<iyes; j++) F->perm[j] = yes[j];
293 186772 : for (i=1; i<ino; i++, j++) F->perm[j] = no[i];
294 259533 : for ( ; j<lv; j++) F->perm[j] = perm[j];
295 66270 : F->allsubFB = NULL;
296 66270 : F->idealperm = gclone(FB_aut_perm(F, auts, cyclic));
297 66270 : if (iyes) assign_subFB(F, yes, iyes);
298 66270 : set_avma(av);
299 66270 : }
300 : static int
301 26398 : subFB_change(FB_t *F)
302 : {
303 26398 : long i, iyes, minsFB, lv = F->KC + 1, l = lg(F->subFB)-1;
304 26398 : pari_sp av = avma;
305 26398 : GEN yes, L_jid = F->L_jid, present = zero_zv(lv-1);
306 :
307 26396 : switch (F->sfb_chg)
308 : {
309 14 : case sfb_INCREASE: minsFB = l + 1; break;
310 26382 : default: minsFB = l; break;
311 : }
312 :
313 26396 : yes = cgetg(minsFB+1, t_VECSMALL); iyes = 1;
314 26396 : if (L_jid)
315 : {
316 33976 : for (i = 1; i < lg(L_jid); i++)
317 : {
318 33835 : long l = L_jid[i];
319 33835 : if (bad_subFB(F, l)) continue;
320 31594 : yes[iyes++] = l;
321 31594 : present[l] = 1;
322 31594 : if (iyes > minsFB) break;
323 : }
324 : }
325 0 : else i = 1;
326 26396 : if (iyes <= minsFB)
327 : {
328 314 : for ( ; i < lv; i++)
329 : {
330 236 : long l = F->perm[i];
331 236 : if (present[l] || bad_subFB(F, l)) continue;
332 71 : yes[iyes++] = l;
333 71 : if (iyes > minsFB) break;
334 : }
335 141 : if (i == lv) return 0;
336 : }
337 26318 : if (zv_equal(F->subFB, yes))
338 : {
339 25555 : if (DEBUGLEVEL) err_printf("\n*** NOT Changing sub factor base\n");
340 : }
341 : else
342 : {
343 763 : if (DEBUGLEVEL) err_printf("\n*** Changing sub factor base\n");
344 763 : assign_subFB(F, yes, iyes);
345 : }
346 26318 : F->sfb_chg = 0; return gc_bool(av, 1);
347 : }
348 :
349 : /* make sure enough room to store n more relations */
350 : static void
351 122420 : pre_allocate(RELCACHE_t *cache, size_t n)
352 : {
353 122420 : size_t len = (cache->last - cache->base) + n;
354 122420 : if (len >= cache->len) reallocate(cache, len << 1);
355 122420 : }
356 :
357 : void
358 134677 : init_GRHcheck(GRHcheck_t *S, long N, long R1, double LOGD)
359 : {
360 134677 : const double c1 = M_PI*M_PI/2;
361 134677 : const double c2 = 3.663862376709;
362 134677 : const double c3 = 3.801387092431; /* Euler + log(8*Pi)*/
363 134677 : S->clone = 0;
364 134677 : S->cN = R1*c2 + N*c1;
365 134677 : S->cD = LOGD - N*c3 - R1*M_PI/2;
366 134677 : S->maxprimes = 16000; /* sufficient for LIMC=176081*/
367 134677 : S->primes = (GRHprime_t*)pari_malloc(S->maxprimes*sizeof(*S->primes));
368 134680 : S->nprimes = 0;
369 134680 : S->limp = 0;
370 134680 : u_forprime_init(&S->P, 2, ULONG_MAX);
371 134679 : }
372 :
373 : void
374 134680 : free_GRHcheck(GRHcheck_t *S)
375 : {
376 134680 : if (S->clone)
377 : {
378 64015 : long i = S->nprimes;
379 : GRHprime_t *pr;
380 7577855 : for (pr = S->primes, i = S->nprimes; i > 0; pr++, i--) gunclone(pr->dec);
381 : }
382 134682 : pari_free(S->primes);
383 134680 : }
384 :
385 : int
386 1532863 : GRHok(GRHcheck_t *S, double L, double SA, double SB)
387 : {
388 1532863 : return (S->cD + (S->cN + 2*SB) / L - 2*SA < -1e-8);
389 : }
390 :
391 : /* Return factorization pattern of p: [f,n], where n[i] primes of
392 : * residue degree f[i] */
393 : static GEN
394 7511696 : get_fs(GEN nf, GEN P, GEN index, ulong p)
395 : {
396 : long j, k, f, n, l;
397 : GEN fs, ns;
398 :
399 7511696 : if (umodiu(index, p))
400 : { /* easy case: p does not divide index */
401 7472774 : GEN F = Flx_degfact(ZX_to_Flx(P,p), p);
402 7473212 : fs = gel(F,1); l = lg(fs);
403 : }
404 : else
405 : {
406 38680 : GEN F = idealprimedec(nf, utoipos(p));
407 38714 : l = lg(F);
408 38714 : fs = cgetg(l, t_VECSMALL);
409 121184 : for (j = 1; j < l; j++) fs[j] = pr_get_f(gel(F,j));
410 : }
411 7511926 : ns = cgetg(l, t_VECSMALL);
412 7510205 : f = fs[1]; n = 1;
413 13910781 : for (j = 2, k = 1; j < l; j++)
414 6400576 : if (fs[j] == f)
415 4675941 : n++;
416 : else
417 : {
418 1724635 : ns[k] = n; fs[k] = f; k++;
419 1724635 : f = fs[j]; n = 1;
420 : }
421 7510205 : ns[k] = n; fs[k] = f; k++;
422 7510205 : setlg(fs, k);
423 7509773 : setlg(ns, k); return mkvec2(fs,ns);
424 : }
425 :
426 : /* cache data for all rational primes up to the LIM */
427 : static void
428 921167 : cache_prime_dec(GRHcheck_t *S, ulong LIM, GEN nf)
429 : {
430 921167 : pari_sp av = avma;
431 : GRHprime_t *pr;
432 : GEN index, P;
433 : double nb;
434 :
435 921167 : if (S->limp >= LIM) return;
436 329615 : S->clone = 1;
437 329615 : nb = primepi_upper_bound((double)LIM); /* #{p <= LIM} <= nb */
438 329624 : GRH_ensure(S, nb+1); /* room for one extra prime */
439 329623 : P = nf_get_pol(nf);
440 329622 : index = nf_get_index(nf);
441 329622 : for (pr = S->primes + S->nprimes;;)
442 7182364 : {
443 7511986 : ulong p = u_forprime_next(&(S->P));
444 7511725 : pr->p = p;
445 7511725 : pr->logp = log((double)p);
446 7511725 : pr->dec = gclone(get_fs(nf, P, index, p));
447 7512070 : S->nprimes++;
448 7512070 : pr++;
449 7512070 : set_avma(av);
450 : /* store up to nextprime(LIM) included */
451 7511990 : if (p >= LIM) { S->limp = p; break; }
452 : }
453 : }
454 :
455 : static double
456 2259028 : tailresback(long R1, long R2, double rK, long C, double C2, double C3, double r1K, double r2K, double logC, double logC2, double logC3)
457 : {
458 2259028 : const double rQ = 1.83787706641;
459 2259028 : const double r1Q = 1.98505372441;
460 2259028 : const double r2Q = 1.07991541347;
461 4518056 : return fabs((R1+R2-1)*(12*logC3+4*logC2-9*logC-6)/(2*C*logC3)
462 2259028 : + (rK-rQ)*(6*logC2 + 5*logC + 2)/(C*logC3)
463 2259028 : - R2*(6*logC2+11*logC+6)/(C2*logC2)
464 2259028 : - 2*(r1K-r1Q)*(3*logC2 + 4*logC + 2)/(C2*logC3)
465 2259028 : + (R1+R2-1)*(12*logC3+40*logC2+45*logC+18)/(6*C3*logC3)
466 2259028 : + (r2K-r2Q)*(2*logC2 + 3*logC + 2)/(C3*logC3));
467 : }
468 :
469 : static double
470 1129511 : tailres(long R1, long R2, double al2K, double rKm, double rKM, double r1Km,
471 : double r1KM, double r2Km, double r2KM, double C, long i)
472 : {
473 : /* C >= 3*2^i, lower bound for eint1(log(C)/2) */
474 : /* for(i=0,30,print(eint1(log(3*2^i)/2))) */
475 : static double tab[] = {
476 : 0.50409264803,
477 : 0.26205336997,
478 : 0.14815491171,
479 : 0.08770540561,
480 : 0.05347651832,
481 : 0.03328934284,
482 : 0.02104510690,
483 : 0.01346475900,
484 : 0.00869778586,
485 : 0.00566279855,
486 : 0.00371111950,
487 : 0.00244567837,
488 : 0.00161948049,
489 : 0.00107686891,
490 : 0.00071868750,
491 : 0.00048119961,
492 : 0.00032312188,
493 : 0.00021753772,
494 : 0.00014679818,
495 : 9.9272855581E-5,
496 : 6.7263969995E-5,
497 : 4.5656812967E-5,
498 : 3.1041124593E-5,
499 : 2.1136011590E-5,
500 : 1.4411645381E-5,
501 : 9.8393304088E-6,
502 : 6.7257395409E-6,
503 : 4.6025878272E-6,
504 : 3.1529719271E-6,
505 : 2.1620490021E-6,
506 : 1.4839266071E-6
507 : };
508 1129511 : const double logC = log(C), logC2 = logC*logC, logC3 = logC*logC2;
509 1129511 : const double C2 = C*C, C3 = C*C2;
510 1129511 : double E1 = i >30? 0: tab[i];
511 1129511 : return al2K*((33*logC2+22*logC+8)/(8*logC3*sqrt(C))+15*E1/16)
512 1129511 : + maxdd(tailresback(rKm,r1KM,r2Km, C,C2,C3,R1,R2,logC,logC2,logC3),
513 1129523 : tailresback(rKM,r1Km,r2KM, C,C2,C3,R1,R2,logC,logC2,logC3))/2
514 1129523 : + ((R1+R2-1)*4*C+R2)*(C2+6*logC)/(4*C2*C2*logC2);
515 : }
516 :
517 : static long
518 64014 : primeneeded(long N, long R1, long R2, double LOGD)
519 : {
520 64014 : const double lim = 0.25; /* should be log(2)/2 == 0.34657... */
521 64014 : const double al2K = 0.3526*LOGD - 0.8212*N + 4.5007;
522 64014 : const double rKm = -1.0155*LOGD + 2.1042*N - 8.3419;
523 64014 : const double rKM = -0.5 *LOGD + 1.2076*N + 1;
524 64014 : const double r1Km = - LOGD + 1.4150*N;
525 64014 : const double r1KM = - LOGD + 1.9851*N;
526 64014 : const double r2Km = - LOGD + 0.9151*N;
527 64014 : const double r2KM = - LOGD + 1.0800*N;
528 64014 : long Cmin = 3, Cmax = 3, i = 0;
529 574243 : while (tailres(R1, R2, al2K, rKm, rKM, r1Km, r1KM, r2Km, r2KM, Cmax, i) > lim)
530 : {
531 510229 : Cmin = Cmax;
532 510229 : Cmax *= 2;
533 510229 : i++;
534 : }
535 64011 : i--;
536 619308 : while (Cmax - Cmin > 1)
537 : {
538 555296 : long t = (Cmin + Cmax)/2;
539 555296 : if (tailres(R1, R2, al2K, rKm, rKM, r1Km, r1KM, r2Km, r2KM, t, i) > lim)
540 344317 : Cmin = t;
541 : else
542 210980 : Cmax = t;
543 : }
544 64012 : return Cmax;
545 : }
546 :
547 : /* ~ 1 / Res(s = 1, zeta_K) */
548 : static GEN
549 64015 : compute_invres(GRHcheck_t *S, long LIMC)
550 : {
551 64015 : pari_sp av = avma;
552 64015 : double loginvres = 0.;
553 : GRHprime_t *pr;
554 : long i;
555 64015 : double logLIMC = log((double)LIMC);
556 64015 : double logLIMC2 = logLIMC*logLIMC, denc;
557 : double c0, c1, c2;
558 64015 : denc = 1/(pow((double)LIMC, 3.) * logLIMC * logLIMC2);
559 64015 : c2 = ( logLIMC2 + 3 * logLIMC / 2 + 1) * denc;
560 64015 : denc *= LIMC;
561 64015 : c1 = (3 * logLIMC2 + 4 * logLIMC + 2) * denc;
562 64015 : denc *= LIMC;
563 64015 : c0 = (3 * logLIMC2 + 5 * logLIMC / 2 + 1) * denc;
564 7521118 : for (pr = S->primes, i = S->nprimes; i > 0; pr++, i--)
565 : {
566 : GEN dec, fs, ns;
567 : long addpsi;
568 : double addpsi1, addpsi2;
569 7513208 : double logp = pr->logp, NPk;
570 7513208 : long j, k, limp = logLIMC/logp;
571 7513208 : ulong p = pr->p, p2 = p*p;
572 7513208 : if (limp < 1) break;
573 7457103 : dec = pr->dec;
574 7457103 : fs = gel(dec, 1); ns = gel(dec, 2);
575 7457103 : loginvres += 1./p;
576 : /* NB: limp = 1 nearly always and limp > 2 for very few primes */
577 8823651 : for (k=2, NPk = p; k <= limp; k++) { NPk *= p; loginvres += 1/(k * NPk); }
578 7457103 : addpsi = limp;
579 7457103 : addpsi1 = p *(pow((double)p , (double)limp)-1)/(p -1);
580 7457103 : addpsi2 = p2*(pow((double)p2, (double)limp)-1)/(p2-1);
581 7457103 : j = lg(fs);
582 16627630 : while (--j > 0)
583 : {
584 : long f, nb, kmax;
585 : double NP, NP2, addinvres;
586 9170527 : f = fs[j]; if (f > limp) continue;
587 3982974 : nb = ns[j];
588 3982974 : NP = pow((double)p, (double)f);
589 3982974 : addinvres = 1/NP;
590 3982974 : kmax = limp / f;
591 4860048 : for (k=2, NPk = NP; k <= kmax; k++) { NPk *= NP; addinvres += 1/(k*NPk); }
592 3982974 : NP2 = NP*NP;
593 3982974 : loginvres -= nb * addinvres;
594 3982974 : addpsi -= nb * f * kmax;
595 3982974 : addpsi1 -= nb*(f*NP *(pow(NP ,(double)kmax)-1)/(NP -1));
596 3982974 : addpsi2 -= nb*(f*NP2*(pow(NP2,(double)kmax)-1)/(NP2-1));
597 : }
598 7457103 : loginvres -= (addpsi*c0 - addpsi1*c1 + addpsi2*c2)*logp;
599 : }
600 64015 : return gc_leaf(av, mpexp(dbltor(loginvres)));
601 : }
602 :
603 : static long
604 64015 : nthideal(GRHcheck_t *S, GEN nf, long n)
605 : {
606 64015 : pari_sp av = avma;
607 64015 : GEN P = nf_get_pol(nf);
608 64015 : ulong p = 0, *vecN = (ulong*)const_vecsmall(n, LONG_MAX);
609 64015 : long i, N = poldegree(P, -1);
610 64014 : for (i = 0; ; i++)
611 230524 : {
612 : GRHprime_t *pr;
613 : GEN fs;
614 294538 : cache_prime_dec(S, p+1, nf);
615 294539 : pr = S->primes + i;
616 294539 : fs = gel(pr->dec, 1);
617 294539 : p = pr->p;
618 294539 : if (fs[1] != N)
619 : {
620 198006 : GEN ns = gel(pr->dec, 2);
621 198006 : long k, l, j = lg(fs);
622 443709 : while (--j > 0)
623 : {
624 245704 : ulong NP = upowuu(p, fs[j]);
625 : long nf;
626 245703 : if (!NP) continue;
627 754226 : for (k = 1; k <= n; k++) if (vecN[k] > NP) break;
628 245311 : if (k > n) continue;
629 : /* vecN[k] <= NP */
630 158895 : nf = ns[j]; /*#{primes of norme NP} = nf, insert them here*/
631 355656 : for (l = k+nf; l <= n; l++) vecN[l] = vecN[l-nf];
632 401642 : for (l = 0; l < nf && k+l <= n; l++) vecN[k+l] = NP;
633 365226 : while (l <= k) vecN[l++] = NP;
634 : }
635 : }
636 294538 : if (p > vecN[n]) break;
637 : }
638 64014 : return gc_long(av, vecN[n]);
639 : }
640 :
641 : /* volume of unit ball in R^n: \pi^{n/2} / \Gamma(n/2 + 1) */
642 : static double
643 66270 : ballvol(long n)
644 : {
645 66270 : double v = odd(n)? 2: 1;
646 151574 : for (; n > 1; n -= 2) v *= (2 * M_PI) / n;
647 66270 : return v;
648 : }
649 :
650 : /* Compute FB, LV, iLP + KC*. Reset perm
651 : * C2: bound for norm of tested prime ideals (includes be_honest())
652 : * C1: bound for p, such that P|p (NP <= C2) used to build relations */
653 : static void
654 66267 : FBgen(FB_t *F, GEN nf, long N, ulong C1, ulong C2, GRHcheck_t *S)
655 : {
656 : GRHprime_t *pr;
657 : long i, ip;
658 : GEN prim;
659 66267 : const double L = log((double)C2 + 0.5);
660 :
661 66267 : cache_prime_dec(S, C2, nf);
662 66267 : pr = S->primes;
663 66267 : F->sfb_chg = 0;
664 66267 : F->FB = cgetg(C2+1, t_VECSMALL);
665 66267 : F->iLP = cgetg(C2+1, t_VECSMALL);
666 66266 : F->LV = zerovec(C2);
667 :
668 66269 : prim = icopy(gen_1);
669 66267 : i = ip = 0;
670 66267 : F->KC = F->KCZ = 0;
671 437324 : for (;; pr++) /* p <= C2 */
672 437324 : {
673 503591 : ulong p = pr->p;
674 : long k, l, m;
675 : GEN LP, nb, f;
676 :
677 503591 : if (!F->KC && p > C1) { F->KCZ = i; F->KC = ip; }
678 503591 : if (p > C2) break;
679 :
680 466364 : if (DEBUGLEVEL>1) err_printf(" %ld",p);
681 :
682 466365 : f = gel(pr->dec, 1); nb = gel(pr->dec, 2);
683 466365 : if (f[1] == N)
684 : {
685 146367 : if (p == C2) break;
686 137820 : continue; /* p inert */
687 : }
688 319998 : l = (long)(L/pr->logp); /* p^f <= C2 <=> f <= l */
689 583650 : for (k=0, m=1; m < lg(f) && f[m]<=l; m++) k += nb[m];
690 319998 : if (!k)
691 : { /* too inert to appear in FB */
692 73055 : if (p == C2) break;
693 72194 : continue;
694 : }
695 246943 : prim[2] = p; LP = idealprimedec_limit_f(nf,prim, l);
696 : /* keep noninert ideals with Norm <= C2 */
697 246945 : if (m == lg(f)) setisclone(LP); /* flag it: all prime divisors in FB */
698 246945 : F->FB[++i]= p;
699 246945 : gel(F->LV,p) = LP;
700 246945 : F->iLP[p] = ip; ip += k;
701 246945 : if (p == C2) break;
702 : }
703 66270 : if (!F->KC) { F->KCZ = i; F->KC = ip; }
704 : /* Note F->KC > 0 otherwise GRHchk is false */
705 66270 : setlg(F->FB, F->KCZ+1); F->KCZ2 = i;
706 66270 : F->prodZ = zv_prod_Z(F->FB);
707 66270 : if (DEBUGLEVEL>1)
708 : {
709 0 : err_printf("\n");
710 0 : if (DEBUGLEVEL>6)
711 : {
712 0 : err_printf("########## FACTORBASE ##########\n\n");
713 0 : err_printf("KC2=%ld, KC=%ld, KCZ=%ld, KCZ2=%ld\n",
714 : ip, F->KC, F->KCZ, F->KCZ2);
715 0 : for (i=1; i<=F->KCZ; i++) err_printf("++ LV[%ld] = %Ps",i,gel(F->LV,F->FB[i]));
716 : }
717 : }
718 66270 : F->perm = NULL; F->L_jid = NULL;
719 66270 : F->ballvol = ballvol(nf_get_degree(nf));
720 66270 : }
721 :
722 : static int
723 496356 : GRHchk(GEN nf, GRHcheck_t *S, ulong LIMC)
724 : {
725 496356 : double logC = log((double)LIMC), SA = 0, SB = 0;
726 496356 : GRHprime_t *pr = S->primes;
727 :
728 496356 : cache_prime_dec(S, LIMC, nf);
729 496355 : for (pr = S->primes;; pr++)
730 3072885 : {
731 3569240 : ulong p = pr->p;
732 : GEN dec, fs, ns;
733 : double logCslogp;
734 : long j;
735 :
736 3569240 : if (p > LIMC) break;
737 3179292 : dec = pr->dec; fs = gel(dec, 1); ns = gel(dec,2);
738 3179292 : logCslogp = logC/pr->logp;
739 5006536 : for (j = 1; j < lg(fs); j++)
740 : {
741 3917533 : long f = fs[j], M, nb;
742 : double logNP, q, A, B;
743 3917533 : if (f > logCslogp) break;
744 1827248 : logNP = f * pr->logp;
745 1827248 : q = 1/sqrt((double)upowuu(p, f));
746 1827244 : A = logNP * q; B = logNP * A; M = (long)(logCslogp/f);
747 1827244 : if (M > 1)
748 : {
749 376419 : double inv1_q = 1 / (1-q);
750 376419 : A *= (1 - pow(q, (double)M)) * inv1_q;
751 376419 : B *= (1 - pow(q, (double)M)*(M+1 - M*q)) * inv1_q * inv1_q;
752 : }
753 1827244 : nb = ns[j];
754 1827244 : SA += nb * A;
755 1827244 : SB += nb * B;
756 : }
757 3179288 : if (p == LIMC) break;
758 : }
759 496351 : return GRHok(S, logC, SA, SB);
760 : }
761 :
762 : /* SMOOTH IDEALS */
763 : static void
764 9210200 : store(long i, long e, FACT *fact)
765 : {
766 9210200 : ++fact[0].pr;
767 9210200 : fact[fact[0].pr].pr = i; /* index */
768 9210200 : fact[fact[0].pr].ex = e; /* exponent */
769 9210200 : }
770 :
771 : /* divide out m by all P|p, k = v_p(Nm) */
772 : static int
773 2451 : divide_p_elt(GEN LP, long ip, long k, GEN m, FACT *fact)
774 : {
775 2451 : long j, l = lg(LP);
776 3413 : for (j=1; j<l; j++)
777 : {
778 3413 : GEN P = gel(LP,j);
779 3413 : long v = ZC_nfval(m, P);
780 3413 : if (!v) continue;
781 2944 : store(ip + j, v, fact); /* v = v_P(m) > 0 */
782 2944 : k -= v * pr_get_f(P);
783 2944 : if (!k) return 1;
784 : }
785 0 : return 0;
786 : }
787 : /* divide out I by all P|p, k = v_p(NI) */
788 : static int
789 185368 : divide_p_id(GEN LP, long ip, long k, GEN nf, GEN I, FACT *fact)
790 : {
791 185368 : long j, l = lg(LP);
792 277972 : for (j=1; j<l; j++)
793 : {
794 270110 : GEN P = gel(LP,j);
795 270110 : long v = idealval(nf,I, P);
796 270111 : if (!v) continue;
797 181006 : store(ip + j, v, fact); /* v = v_P(I) > 0 */
798 181006 : k -= v * pr_get_f(P);
799 181006 : if (!k) return 1;
800 : }
801 7862 : return 0;
802 : }
803 : /* divide out m/I by all P|p, k = v_p(Nm/NI) */
804 : static int
805 5286662 : divide_p_quo(GEN LP, long ip, long k, GEN nf, GEN I, GEN m, FACT *fact)
806 : {
807 5286662 : long j, l = lg(LP);
808 17414135 : for (j=1; j<l; j++)
809 : {
810 17325439 : GEN P = gel(LP,j);
811 17325439 : long v = ZC_nfval(m, P);
812 17324094 : if (!v) continue;
813 7870736 : v -= idealval(nf,I, P);
814 7872232 : if (!v) continue;
815 6706177 : store(ip + j, v, fact); /* v = v_P(m / I) > 0 */
816 6706217 : k -= v * pr_get_f(P);
817 6706154 : if (!k) return 1;
818 : }
819 88696 : return 0;
820 : }
821 :
822 : static int
823 5474480 : divide_p(FB_t *F, long p, long k, GEN nf, GEN I, GEN m, FACT *fact)
824 : {
825 5474480 : GEN LP = gel(F->LV,p);
826 5474480 : long ip = F->iLP[p];
827 5474480 : if (!m) return divide_p_id (LP,ip,k,nf,I,fact);
828 5289112 : if (!I) return divide_p_elt(LP,ip,k,m,fact);
829 5286661 : return divide_p_quo(LP,ip,k,nf,I,m,fact);
830 : }
831 :
832 : /* Let x = m if I == NULL,
833 : * I if m == NULL,
834 : * m/I otherwise.
835 : * Can we factor the integral primitive ideal x ? |N| = Norm x > 0 */
836 : static long
837 18216244 : can_factor(FB_t *F, GEN nf, GEN I, GEN m, GEN N, FACT *fact)
838 : {
839 : GEN f, p, e;
840 : long i, l;
841 18216244 : fact[0].pr = 0;
842 18216244 : if (is_pm1(N)) return 1;
843 17239576 : if (!is_pm1(Z_ppo(N, F->prodZ))) return 0;
844 2779797 : f = absZ_factor(N); p = gel(f,1); e = gel(f,2); l = lg(p);
845 8158066 : for (i = 1; i < l; i++)
846 5474468 : if (!divide_p(F, itou(gel(p,i)), itou(gel(e,i)), nf, I, m, fact))
847 : {
848 96314 : if (DEBUGLEVEL > 1) err_printf(".");
849 96314 : return 0;
850 : }
851 2683598 : return 1;
852 : }
853 :
854 : /* can we factor m/I ? [m in I from idealpseudomin_nonscalar], NI = norm I */
855 : static long
856 16806080 : factorgen(FB_t *F, GEN nf, GEN I, GEN NI, GEN m, FACT *fact)
857 : {
858 : long e;
859 16806080 : GEN Nm = embed_norm(RgM_RgC_mul(nf_get_M(nf),m), nf_get_r1(nf));
860 16806149 : GEN N = grndtoi(NI? divri(Nm, NI): Nm, &e); /* ~ N(m/I) */
861 16806032 : if (e > -32)
862 : {
863 0 : if (DEBUGLEVEL > 1) err_printf("+");
864 0 : return 0;
865 : }
866 16806032 : return can_factor(F, nf, I, m, N, fact);
867 : }
868 :
869 : /* FUNDAMENTAL UNITS */
870 :
871 : /* a, y real. Return (Re(x) + a) + I * (Im(x) % y) */
872 : static GEN
873 6901120 : addRe_modIm(GEN x, GEN a, GEN y, GEN iy)
874 : {
875 : GEN z;
876 6901120 : if (typ(x) == t_COMPLEX)
877 : {
878 4900719 : GEN re, im = modRr_i(gel(x,2), y, iy);
879 4900687 : if (!im) return NULL;
880 4900687 : re = gadd(gel(x,1), a);
881 4900634 : z = gequal0(im)? re: mkcomplex(re, im);
882 : }
883 : else
884 2000401 : z = gadd(x, a);
885 6901039 : return z;
886 : }
887 : static GEN
888 204630 : modIm(GEN x, GEN y, GEN iy)
889 : {
890 204630 : if (typ(x) == t_COMPLEX)
891 : {
892 191457 : GEN im = modRr_i(gel(x,2), y, iy);
893 191453 : if (!im) return NULL;
894 191453 : x = gequal0(im)? gel(x,1): mkcomplex(gel(x,1), im);
895 : }
896 204627 : return x;
897 : }
898 :
899 : /* clean archimedean components. ipi = 2^n / pi (n arbitrary); its
900 : * exponent may be modified */
901 : static GEN
902 3066383 : cleanarch(GEN x, long N, GEN ipi, long prec)
903 : {
904 : long i, l, R1, RU;
905 3066383 : GEN s, y = cgetg_copy(x, &l);
906 :
907 3066382 : if (!ipi) ipi = invr(mppi(prec));
908 3066373 : if (typ(x) == t_MAT)
909 : {
910 528637 : for (i = 1; i < l; i++)
911 464474 : if (!(gel(y,i) = cleanarch(gel(x,i), N, ipi, prec))) return NULL;
912 64163 : return y;
913 : }
914 3002204 : RU = l-1; R1 = (RU<<1) - N;
915 3002204 : s = gdivgs(RgV_sum(real_i(x)), -N); /* -log |norm(x)| / N */
916 3002184 : i = 1;
917 3002184 : if (R1)
918 : {
919 2523885 : GEN pi2 = Pi2n(1, prec);
920 2523890 : setexpo(ipi, -3); /* 1/(2pi) */
921 7790500 : for (; i <= R1; i++)
922 5266652 : if (!(gel(y,i) = addRe_modIm(gel(x,i), s, pi2, ipi))) return NULL;
923 : }
924 3002147 : if (i <= RU)
925 : {
926 1075178 : GEN pi4 = Pi2n(2, prec), s2 = gmul2n(s, 1);
927 1075194 : setexpo(ipi, -4); /* 1/(4pi) */
928 2709707 : for (; i <= RU; i++)
929 1634477 : if (!(gel(y,i) = addRe_modIm(gel(x,i), s2, pi4, ipi))) return NULL;
930 : }
931 3002199 : return y;
932 : }
933 : GEN
934 194924 : nf_cxlog_normalize(GEN nf, GEN x, long prec)
935 : {
936 194924 : long N = nf_get_degree(nf);
937 194924 : return cleanarch(x, N, NULL, prec);
938 : }
939 :
940 : /* clean unit archimedean components. ipi = 2^n / pi (n arbitrary); its
941 : * exponent may be modified */
942 : static GEN
943 133887 : cleanarchunit(GEN x, long N, GEN ipi, long prec)
944 : {
945 : long i, l, R1, RU;
946 133887 : GEN y = cgetg_copy(x, &l);
947 :
948 133887 : if (!ipi) ipi = invr(mppi(prec));
949 133886 : if (typ(x) == t_MAT)
950 : {
951 133880 : for (i = 1; i < l; i++)
952 69865 : if (!(gel(y,i) = cleanarchunit(gel(x,i), N, ipi, prec))) return NULL;
953 64015 : return y;
954 : }
955 69865 : if (gexpo(RgV_sum(real_i(x))) > -10) return NULL;
956 69859 : RU = l-1; R1 = (RU<<1) - N;
957 69859 : i = 1;
958 69859 : if (R1)
959 : {
960 55376 : GEN pi2 = Pi2n(1, prec);
961 55377 : setexpo(ipi, -3); /* 1/(2pi) */
962 189319 : for (; i <= R1; i++)
963 133946 : if (!(gel(y,i) = modIm(gel(x,i), pi2, ipi))) return NULL;
964 : }
965 69856 : if (i <= RU)
966 : {
967 34453 : GEN pi4 = Pi2n(2, prec);
968 34454 : setexpo(ipi, -4); /* 1/(4pi) */
969 105140 : for (; i <= RU; i++)
970 70684 : if (!(gel(y,i) = modIm(gel(x,i), pi4, ipi))) return NULL;
971 : }
972 69859 : return y;
973 : }
974 :
975 : static GEN
976 396 : not_given(long reason)
977 : {
978 396 : if (DEBUGLEVEL)
979 0 : switch(reason)
980 : {
981 0 : case fupb_LARGE:
982 0 : pari_warn(warner,"fundamental units too large, not given");
983 0 : break;
984 0 : case fupb_PRECI:
985 0 : pari_warn(warner,"insufficient precision for fundamental units, not given");
986 0 : break;
987 : }
988 396 : return NULL;
989 : }
990 :
991 : /* check whether exp(x) will 1) get too big (real(x) large), 2) require
992 : * large accuracy for argument reduction (imag(x) large) */
993 : static long
994 2838182 : expbitprec(GEN x, long *e)
995 : {
996 : GEN re, im;
997 2838182 : if (typ(x) != t_COMPLEX) re = x;
998 : else
999 : {
1000 1776554 : im = gel(x,2); *e = maxss(*e, expo(im) + 5 - bit_prec(im));
1001 1776554 : re = gel(x,1);
1002 : }
1003 2838182 : return (expo(re) <= 20);
1004 :
1005 : }
1006 : static long
1007 1234944 : RgC_expbitprec(GEN x)
1008 : {
1009 1234944 : long l = lg(x), i, e = - (long)HIGHEXPOBIT;
1010 3868026 : for (i = 1; i < l; i++)
1011 2633656 : if (!expbitprec(gel(x,i), &e)) return LONG_MAX;
1012 1234370 : return e;
1013 : }
1014 : static long
1015 48797 : RgM_expbitprec(GEN x)
1016 : {
1017 48797 : long i, j, I, J, e = - (long)HIGHEXPOBIT;
1018 48797 : RgM_dimensions(x, &I,&J);
1019 118587 : for (j = 1; j <= J; j++)
1020 274316 : for (i = 1; i <= I; i++)
1021 204526 : if (!expbitprec(gcoeff(x,i,j), &e)) return LONG_MAX;
1022 48734 : return e;
1023 : }
1024 :
1025 : static GEN
1026 1379 : FlxqX_chinese_unit(GEN X, GEN U, GEN invzk, GEN D, GEN T, ulong p)
1027 : {
1028 1379 : long i, lU = lg(U), lX = lg(X), d = lg(invzk)-1;
1029 1379 : GEN M = cgetg(lU, t_MAT);
1030 1379 : if (D)
1031 : {
1032 1272 : D = Flv_inv(D, p);
1033 69663 : for (i = 1; i < lX; i++)
1034 68391 : if (uel(D, i) != 1)
1035 56548 : gel(X,i) = Flx_Fl_mul(gel(X,i), uel(D,i), p);
1036 : }
1037 3878 : for (i = 1; i < lU; i++)
1038 : {
1039 2499 : GEN H = FlxqV_factorback(X, gel(U, i), T, p);
1040 2499 : gel(M, i) = Flm_Flc_mul(invzk, Flx_to_Flv(H, d), p);
1041 : }
1042 1379 : return M;
1043 : }
1044 :
1045 : static GEN
1046 274 : chinese_unit_slice(GEN A, GEN U, GEN B, GEN D, GEN C, GEN P, GEN *mod)
1047 : {
1048 274 : pari_sp av = avma;
1049 274 : long i, n = lg(P)-1, v = varn(C);
1050 : GEN H, T;
1051 274 : if (n == 1)
1052 : {
1053 0 : ulong p = uel(P,1);
1054 0 : GEN a = ZXV_to_FlxV(A, p), b = ZM_to_Flm(B, p), c = ZX_to_Flx(C, p);
1055 0 : GEN d = D ? ZV_to_Flv(D, p): NULL;
1056 0 : GEN Hp = FlxqX_chinese_unit(a, U, b, d, c, p);
1057 0 : H = gc_upto(av, Flm_to_ZM(Hp));
1058 0 : *mod = utoi(p);
1059 0 : return H;
1060 : }
1061 274 : T = ZV_producttree(P);
1062 274 : A = ZXC_nv_mod_tree(A, P, T, v);
1063 274 : B = ZM_nv_mod_tree(B, P, T);
1064 274 : D = D ? ZV_nv_mod_tree(D, P, T): NULL;
1065 274 : C = ZX_nv_mod_tree(C, P, T);
1066 :
1067 274 : H = cgetg(n+1, t_VEC);
1068 1653 : for(i=1; i <= n; i++)
1069 : {
1070 1379 : ulong p = P[i];
1071 1379 : GEN a = gel(A,i), b = gel(B,i), c = gel(C,i), d = D ? gel(D,i): NULL;
1072 1379 : gel(H,i) = FlxqX_chinese_unit(a, U, b, d, c, p);
1073 : }
1074 274 : H = nmV_chinese_center_tree_seq(H, P, T, ZV_chinesetree(P, T));
1075 274 : *mod = gmael(T, lg(T)-1, 1); return gc_all(av, 2, &H, mod);
1076 : }
1077 :
1078 : GEN
1079 274 : chinese_unit_worker(GEN P, GEN A, GEN U, GEN B, GEN D, GEN C)
1080 : {
1081 274 : GEN V = cgetg(3, t_VEC);
1082 274 : gel(V,1) = chinese_unit_slice(A, U, B, isintzero(D) ? NULL: D, C, P, &gel(V,2));
1083 274 : return V;
1084 : }
1085 :
1086 : /* Let x = \prod X[i]^E[i] = u, return u.
1087 : * If dX != NULL, X[i] = nX[i] / dX[i] where nX[i] is a ZX, dX[i] in Z */
1088 : static GEN
1089 94 : chinese_unit(GEN nf, GEN nX, GEN dX, GEN U, ulong bnd)
1090 : {
1091 94 : pari_sp av = avma;
1092 94 : GEN f = nf_get_index(nf), T = nf_get_pol(nf), invzk = nf_get_invzk(nf);
1093 : GEN H, mod;
1094 : forprime_t S;
1095 94 : GEN worker = snm_closure(is_entry("_chinese_unit_worker"),
1096 : mkcol5(nX, U, invzk, dX? dX: gen_0, T));
1097 94 : init_modular_big(&S);
1098 94 : H = gen_crt("chinese_units", worker, &S, f, bnd, 0, &mod, nmV_chinese_center, FpM_center);
1099 94 : settyp(H, t_VEC); return gc_GEN(av, H);
1100 : }
1101 :
1102 : /* *pE a ZM */
1103 : static void
1104 164 : ZM_remove_unused(GEN *pE, GEN *pX)
1105 : {
1106 164 : long j, k, l = lg(*pX);
1107 164 : GEN E = *pE, v = cgetg(l, t_VECSMALL);
1108 16395 : for (j = k = 1; j < l; j++)
1109 16231 : if (!ZMrow_equal0(E, j)) v[k++] = j;
1110 164 : if (k < l)
1111 : {
1112 164 : setlg(v, k);
1113 164 : *pX = vecpermute(*pX,v);
1114 164 : *pE = rowpermute(E,v);
1115 : }
1116 164 : }
1117 :
1118 : /* s = -log|norm(x)|/N */
1119 : static GEN
1120 1304798 : fixarch(GEN x, GEN s, long R1)
1121 : {
1122 : long i, l;
1123 1304798 : GEN y = cgetg_copy(x, &l);
1124 3642692 : for (i = 1; i <= R1; i++) gel(y,i) = gadd(s, gel(x,i));
1125 1805757 : for ( ; i < l; i++) gel(y,i) = gadd(s, gmul2n(gel(x,i),-1));
1126 1304801 : return y;
1127 : }
1128 :
1129 : static GEN
1130 64015 : getfu(GEN nf, GEN *ptA, GEN *ptU, long prec)
1131 : {
1132 64015 : GEN U, y, matep, A, T = nf_get_pol(nf), M = nf_get_M(nf);
1133 64015 : long e, j, R1, RU, N = degpol(T);
1134 :
1135 64015 : R1 = nf_get_r1(nf); RU = (N+R1) >> 1;
1136 64015 : if (RU == 1) return cgetg(1,t_VEC);
1137 :
1138 48797 : A = *ptA;
1139 48797 : matep = cgetg(RU,t_MAT);
1140 118656 : for (j = 1; j < RU; j++)
1141 : {
1142 69860 : GEN Aj = gel(A,j), s = gdivgs(RgV_sum(real_i(Aj)), -N);
1143 69859 : gel(matep,j) = fixarch(Aj, s, R1);
1144 : }
1145 48796 : U = lll(real_i(matep));
1146 48797 : if (lg(U) < RU) return not_given(fupb_PRECI);
1147 48797 : if (ptU) { *ptU = U; *ptA = A = RgM_ZM_mul(A,U); }
1148 48797 : y = RgM_ZM_mul(matep,U);
1149 48797 : e = RgM_expbitprec(y);
1150 48797 : if (e >= 0) return not_given(e == LONG_MAX? fupb_LARGE: fupb_PRECI);
1151 48734 : if (prec <= 0) prec = gprecision(A);
1152 48734 : y = RgM_solve_realimag(M, gexp(y,prec));
1153 48734 : if (!y) return not_given(fupb_PRECI);
1154 48734 : y = grndtoi(y, &e); if (e >= 0) return not_given(fupb_PRECI);
1155 48407 : settyp(y, t_VEC);
1156 :
1157 48407 : if (!ptU) *ptA = A = RgM_ZM_mul(A, U);
1158 117519 : for (j = 1; j < RU; j++)
1159 : { /* y[i] are hopefully unit generators. Normalize: smallest T2 norm */
1160 69118 : GEN u = gel(y,j), v = zk_inv(nf, u);
1161 69120 : if (!v || !is_pm1(Q_denom(v)) || ZV_isscalar(u))
1162 8 : return not_given(fupb_PRECI);
1163 69112 : if (gcmp(RgC_fpnorml2(v,DEFAULTPREC), RgC_fpnorml2(u,DEFAULTPREC)) < 0)
1164 : {
1165 29885 : gel(A,j) = RgC_neg(gel(A,j));
1166 29885 : if (ptU) gel(U,j) = ZC_neg(gel(U,j));
1167 29886 : u = v;
1168 : }
1169 69110 : gel(y,j) = nf_to_scalar_or_alg(nf, u);
1170 : }
1171 48401 : return y;
1172 : }
1173 :
1174 : static void
1175 0 : err_units() { pari_err_PREC("makeunits [cannot get units, use bnfinit(,1)]"); }
1176 :
1177 : /* bound for log2 |sigma(u)|, sigma complex embedding, u fundamental unit
1178 : * attached to bnf_get_logfu */
1179 : static double
1180 94 : log2fubound(GEN bnf)
1181 : {
1182 94 : GEN LU = bnf_get_logfu(bnf);
1183 94 : long i, j, l = lg(LU), r1 = nf_get_r1(bnf_get_nf(bnf));
1184 94 : double e = 0.0;
1185 330 : for (j = 1; j < l; j++)
1186 : {
1187 236 : GEN u = gel(LU,j);
1188 624 : for (i = 1; i <= r1; i++)
1189 : {
1190 388 : GEN E = real_i(gel(u,i));
1191 388 : e = maxdd(e, gtodouble(E));
1192 : }
1193 842 : for ( ; i <= l; i++)
1194 : {
1195 606 : GEN E = real_i(gel(u,i));
1196 606 : e = maxdd(e, gtodouble(E) / 2);
1197 : }
1198 : }
1199 94 : return e / M_LN2;
1200 : }
1201 : /* bound for log2(|RgM_solve_realimag(M, y)|_oo / |y|_oo)*/
1202 : static double
1203 94 : log2Mbound(GEN nf)
1204 : {
1205 94 : GEN G = nf_get_G(nf), D = nf_get_disc(nf);
1206 94 : long r2 = nf_get_r2(nf), l = lg(G), i;
1207 94 : double e, d = dbllog2(D)/2 - r2 * M_LN2; /* log2 |det(split_realimag(M))| */
1208 94 : e = log2(nf_get_degree(nf));
1209 535 : for (i = 2; i < l; i++) e += dbllog2(gnorml2(gel(G,i))); /* Hadamard bound */
1210 94 : return e / 2 - d;
1211 : }
1212 :
1213 : static GEN
1214 94 : vec_chinese_units(GEN bnf)
1215 : {
1216 94 : GEN nf = bnf_get_nf(bnf), SUnits = bnf_get_sunits(bnf);
1217 94 : double bnd = ceil(log2Mbound(nf) + log2fubound(bnf));
1218 94 : GEN X, dX, Y, U, f = nf_get_index(nf);
1219 94 : long j, l, v = nf_get_varn(nf);
1220 94 : if (!SUnits) err_units(); /* no compact units */
1221 94 : Y = gel(SUnits,1);
1222 94 : U = gel(SUnits,2);
1223 94 : ZM_remove_unused(&U, &Y); l = lg(Y); X = cgetg(l, t_VEC);
1224 94 : if (is_pm1(f)) f = dX = NULL; else dX = cgetg(l, t_VEC);
1225 5142 : for (j = 1; j < l; j++)
1226 : {
1227 5048 : GEN t = nf_to_scalar_or_alg(nf, gel(Y,j));
1228 5048 : if (f)
1229 : {
1230 : GEN den;
1231 4202 : t = Q_remove_denom(t, &den);
1232 4202 : gel(dX,j) = den ? den: gen_1;
1233 : }
1234 5048 : gel(X,j) = typ(t) == t_INT? scalarpol_shallow(t,v): t;
1235 : }
1236 94 : if (dblexpo(bnd) >= BITS_IN_LONG)
1237 0 : pari_err_OVERFLOW("vec_chinese_units [units too large]");
1238 94 : return chinese_unit(nf, X, dX, U, (ulong)bnd);
1239 : }
1240 :
1241 : static GEN
1242 24908 : makeunits(GEN bnf)
1243 : {
1244 24908 : GEN nf = bnf_get_nf(bnf), fu = bnf_get_fu_nocheck(bnf);
1245 24908 : GEN tu = nf_to_scalar_or_basis(nf, bnf_get_tuU(bnf));
1246 24908 : fu = (typ(fu) == t_MAT)? vec_chinese_units(bnf): matalgtobasis(nf, fu);
1247 24908 : return vec_prepend(fu, tu);
1248 : }
1249 :
1250 : /*******************************************************************/
1251 : /* */
1252 : /* PRINCIPAL IDEAL ALGORITHM (DISCRETE LOG) */
1253 : /* */
1254 : /*******************************************************************/
1255 :
1256 : /* G: prime ideals, E: vector of nonnegative exponents.
1257 : * C = possible extra prime (^1) or NULL
1258 : * Return Norm (product) */
1259 : static GEN
1260 69 : get_norm_fact_primes(GEN G, GEN E, GEN C)
1261 : {
1262 69 : pari_sp av=avma;
1263 69 : GEN N = gen_1, P, p;
1264 69 : long i, c = lg(E);
1265 69 : for (i=1; i<c; i++)
1266 : {
1267 0 : GEN ex = gel(E,i);
1268 0 : long s = signe(ex);
1269 0 : if (!s) continue;
1270 :
1271 0 : P = gel(G,i); p = pr_get_p(P);
1272 0 : N = mulii(N, powii(p, mului(pr_get_f(P), ex)));
1273 : }
1274 69 : if (C) N = mulii(N, pr_norm(C));
1275 69 : return gc_INT(av, N);
1276 : }
1277 :
1278 : /* gen: HNF ideals */
1279 : static GEN
1280 1229334 : get_norm_fact(GEN gen, GEN ex, GEN *pd)
1281 : {
1282 1229334 : long i, c = lg(ex);
1283 : GEN d,N,I,e,n,ne,de;
1284 1229334 : d = N = gen_1;
1285 1525994 : for (i=1; i<c; i++)
1286 296660 : if (signe(gel(ex,i)))
1287 : {
1288 175539 : I = gel(gen,i); e = gel(ex,i); n = ZM_det_triangular(I);
1289 175539 : ne = powii(n,e);
1290 175539 : de = equalii(n, gcoeff(I,1,1))? ne: powii(gcoeff(I,1,1), e);
1291 175539 : N = mulii(N, ne);
1292 175539 : d = mulii(d, de);
1293 : }
1294 1229334 : *pd = d; return N;
1295 : }
1296 :
1297 : static GEN
1298 1390221 : get_pr_lists(GEN FB, long N, int list_pr)
1299 : {
1300 : GEN pr, L;
1301 1390221 : long i, l = lg(FB), p, pmax;
1302 :
1303 1390221 : pmax = 0;
1304 9535451 : for (i=1; i<l; i++)
1305 : {
1306 8145230 : pr = gel(FB,i); p = pr_get_smallp(pr);
1307 8145230 : if (p > pmax) pmax = p;
1308 : }
1309 1390221 : L = const_vec(pmax, NULL);
1310 1390222 : if (list_pr)
1311 : {
1312 0 : for (i=1; i<l; i++)
1313 : {
1314 0 : pr = gel(FB,i); p = pr_get_smallp(pr);
1315 0 : if (!L[p]) gel(L,p) = vectrunc_init(N+1);
1316 0 : vectrunc_append(gel(L,p), pr);
1317 : }
1318 0 : for (p=1; p<=pmax; p++)
1319 0 : if (L[p]) gen_sort_inplace(gel(L,p), (void*)&cmp_prime_over_p,
1320 : &cmp_nodata, NULL);
1321 : }
1322 : else
1323 : {
1324 9535455 : for (i=1; i<l; i++)
1325 : {
1326 8145233 : pr = gel(FB,i); p = pr_get_smallp(pr);
1327 8145233 : if (!L[p]) gel(L,p) = vecsmalltrunc_init(N+1);
1328 8145232 : vecsmalltrunc_append(gel(L,p), i);
1329 : }
1330 : }
1331 1390222 : return L;
1332 : }
1333 :
1334 : /* recover FB, LV, iLP, KCZ from Vbase */
1335 : static GEN
1336 1390220 : recover_partFB(FB_t *F, GEN Vbase, long N)
1337 : {
1338 1390220 : GEN FB, LV, iLP, L = get_pr_lists(Vbase, N, 0);
1339 1390223 : long l = lg(L), p, ip, i;
1340 :
1341 1390223 : i = ip = 0;
1342 1390223 : FB = cgetg(l, t_VECSMALL);
1343 1390223 : iLP= cgetg(l, t_VECSMALL);
1344 1390222 : LV = cgetg(l, t_VEC);
1345 20365924 : for (p = 2; p < l; p++)
1346 : {
1347 18975698 : if (!L[p]) continue;
1348 4446141 : FB[++i] = p;
1349 4446141 : gel(LV,p) = vecpermute(Vbase, gel(L,p));
1350 4446144 : iLP[p]= ip; ip += lg(gel(L,p))-1;
1351 : }
1352 1390226 : F->KCZ = i;
1353 1390226 : F->KC = ip;
1354 1390226 : F->FB = FB; setlg(FB, i+1);
1355 1390226 : F->prodZ = zv_prod_Z(F->FB);
1356 1390221 : F->LV = LV;
1357 1390221 : F->iLP= iLP; return L;
1358 : }
1359 :
1360 : /* add v^e to factorization */
1361 : static void
1362 2845212 : add_to_fact(long v, long e, FACT *fact)
1363 : {
1364 2845212 : long i, n = fact[0].pr;
1365 9618069 : for (i=1; i<=n; i++)
1366 7297980 : if (fact[i].pr == v) { fact[i].ex += e; return; }
1367 2320089 : store(v, e, fact);
1368 : }
1369 : static void
1370 0 : inv_fact(FACT *fact)
1371 : {
1372 0 : long i, n = fact[0].pr;
1373 0 : for (i=1; i<=n; i++) fact[i].ex = -fact[i].ex;
1374 0 : }
1375 :
1376 : /* L (small) list of primes above the same p including pr. Return pr index */
1377 : static int
1378 3349 : pr_index(GEN L, GEN pr)
1379 : {
1380 3349 : long j, l = lg(L);
1381 3349 : GEN al = pr_get_gen(pr);
1382 3349 : for (j=1; j<l; j++)
1383 3349 : if (ZV_equal(al, pr_get_gen(gel(L,j)))) return j;
1384 0 : pari_err_BUG("codeprime");
1385 : return 0; /* LCOV_EXCL_LINE */
1386 : }
1387 :
1388 : static long
1389 3349 : Vbase_to_FB(FB_t *F, GEN pr)
1390 : {
1391 3349 : long p = pr_get_smallp(pr);
1392 3349 : return F->iLP[p] + pr_index(gel(F->LV,p), pr);
1393 : }
1394 :
1395 : /* x, y 2 extended ideals whose first component is an integral HNF and second
1396 : * a famat */
1397 : static GEN
1398 3512 : idealHNF_mulred(GEN nf, GEN x, GEN y)
1399 : {
1400 3512 : GEN A = idealHNF_mul(nf, gel(x,1), gel(y,1));
1401 3512 : GEN F = famat_mul_shallow(gel(x,2), gel(y,2));
1402 3512 : return idealred(nf, mkvec2(A, F));
1403 : }
1404 : /* idealred(x * pr^n), n > 0 is small, x extended ideal. Reduction in order to
1405 : * avoid prec pb: don't let id become too large as lgsub increases */
1406 : static GEN
1407 4488 : idealmulpowprime2(GEN nf, GEN x, GEN pr, ulong n)
1408 : {
1409 4488 : GEN A = idealmulpowprime(nf, gel(x,1), pr, utoipos(n));
1410 4488 : return mkvec2(A, gel(x,2));
1411 : }
1412 : static GEN
1413 65763 : init_famat(GEN x) { return mkvec2(x, trivial_fact()); }
1414 : /* optimized idealfactorback + reduction; z = init_famat() */
1415 : static GEN
1416 28776 : genback(GEN z, GEN nf, GEN P, GEN E)
1417 : {
1418 28776 : long i, l = lg(E);
1419 28776 : GEN I = NULL;
1420 76622 : for (i = 1; i < l; i++)
1421 47845 : if (signe(gel(E,i)))
1422 : {
1423 : GEN J;
1424 32288 : gel(z,1) = gel(P,i);
1425 32288 : J = idealpowred(nf, z, gel(E,i));
1426 32289 : I = I? idealHNF_mulred(nf, I, J): J;
1427 : }
1428 28777 : return I; /* != NULL since a generator */
1429 : }
1430 :
1431 : static GEN
1432 1250412 : SPLIT_i(FB_t *F, GEN nf, GEN G, GEN x, GEN xred, GEN Nx, FACT *fact)
1433 : {
1434 1250412 : pari_sp av = avma;
1435 1250412 : GEN L = idealpseudominvec(xred, G);
1436 1250409 : long k, l = lg(L);
1437 1333362 : for(k = 1; k < l; k++)
1438 1317435 : if (factorgen(F, nf, x, Nx, gel(L,k), fact)) return gel(L,k);
1439 15927 : return gc_NULL(av);
1440 : }
1441 : /* return famat y (principal ideal) such that y / x is smooth [wrt Vbase] */
1442 : static GEN
1443 1406567 : SPLIT(FB_t *F, GEN nf, GEN x, GEN Vbase, FACT *fact)
1444 : {
1445 1406567 : GEN vecG, ex, y, x0, Nx = ZM_det_triangular(x);
1446 : long nbtest_lim, nbtest, i, j, ru, lgsub;
1447 : pari_sp av;
1448 :
1449 : /* try without reduction if x is small */
1450 2812951 : if (expi(gcoeff(x,1,1)) < 100 &&
1451 1578470 : can_factor(F, nf, x, NULL, Nx, fact)) return NULL;
1452 1234484 : if ((y = SPLIT_i(F, nf, nf_get_roundG(nf), x, x, Nx, fact))) return y;
1453 :
1454 : /* reduce in various directions */
1455 8796 : ru = lg(nf_get_roots(nf));
1456 8796 : vecG = cgetg(ru, t_VEC);
1457 14345 : for (j=1; j<ru; j++)
1458 : {
1459 12597 : gel(vecG,j) = nf_get_Gtwist1(nf, j);
1460 12597 : if ((y = SPLIT_i(F, nf, gel(vecG,j), x, x, Nx, fact))) return y;
1461 : }
1462 :
1463 : /* tough case, multiply by random products */
1464 1748 : lgsub = 3; nbtest = 1; nbtest_lim = 4;
1465 1748 : ex = cgetg(lgsub, t_VECSMALL);
1466 1748 : x0 = init_famat(x);
1467 : for(;;)
1468 594 : {
1469 2342 : GEN Ired, I, NI, id = x0;
1470 2342 : av = avma;
1471 2342 : if (DEBUGLEVEL>2) err_printf("# ideals tried = %ld\n",nbtest);
1472 7138 : for (i=1; i<lgsub; i++)
1473 : {
1474 4796 : ex[i] = random_bits(RANDOM_BITS);
1475 4796 : if (ex[i]) id = idealmulpowprime2(nf, id, gel(Vbase,i), ex[i]);
1476 : }
1477 2342 : if (id == x0) continue;
1478 : /* I^(-1) * \prod Vbase[i]^ex[i] = (id[2]) / x */
1479 :
1480 2321 : I = gel(id,1); NI = ZM_det_triangular(I);
1481 2321 : if (can_factor(F, nf, I, NULL, NI, fact))
1482 : {
1483 0 : inv_fact(fact); /* I^(-1) */
1484 0 : for (i=1; i<lgsub; i++)
1485 0 : if (ex[i]) add_to_fact(Vbase_to_FB(F,gel(Vbase,i)), ex[i], fact);
1486 0 : return gel(id,2);
1487 : }
1488 2321 : Ired = ru == 2? I: ZM_lll(I, 0.99, LLL_INPLACE);
1489 3903 : for (j=1; j<ru; j++)
1490 3330 : if ((y = SPLIT_i(F, nf, gel(vecG,j), I, Ired, NI, fact)))
1491 : {
1492 5265 : for (i=1; i<lgsub; i++)
1493 3517 : if (ex[i]) add_to_fact(Vbase_to_FB(F,gel(Vbase,i)), ex[i], fact);
1494 1748 : return famat_mul_shallow(gel(id,2), y);
1495 : }
1496 573 : set_avma(av);
1497 573 : if (++nbtest > nbtest_lim)
1498 : {
1499 21 : nbtest = 0;
1500 21 : if (++lgsub < minss(8, lg(Vbase)-1))
1501 : {
1502 21 : nbtest_lim <<= 1;
1503 21 : ex = cgetg(lgsub, t_VECSMALL);
1504 : }
1505 0 : else nbtest_lim = LONG_MAX; /* don't increase further */
1506 21 : if (DEBUGLEVEL>2) err_printf("SPLIT: increasing factor base [%ld]\n",lgsub);
1507 : }
1508 : }
1509 : }
1510 :
1511 : INLINE GEN
1512 1395132 : bnf_get_W(GEN bnf) { return gel(bnf,1); }
1513 : INLINE GEN
1514 2780336 : bnf_get_B(GEN bnf) { return gel(bnf,2); }
1515 : INLINE GEN
1516 2814914 : bnf_get_C(GEN bnf) { return gel(bnf,4); }
1517 : INLINE GEN
1518 1390239 : bnf_get_vbase(GEN bnf) { return gel(bnf,5); }
1519 : INLINE GEN
1520 1390163 : bnf_get_Ur(GEN bnf) { return gmael(bnf,9,1); }
1521 : INLINE GEN
1522 271813 : bnf_get_ga(GEN bnf) { return gmael(bnf,9,2); }
1523 : INLINE GEN
1524 276769 : bnf_get_GD(GEN bnf) { return gmael(bnf,9,3); }
1525 :
1526 : /* Return y (as an elt of K or a t_MAT representing an elt in Z[K])
1527 : * such that x / (y) is smooth and store the exponents of its factorization
1528 : * on g_W and g_B in Wex / Bex; return NULL for y = 1 */
1529 : static GEN
1530 1390156 : split_ideal(GEN bnf, GEN x, GEN *pWex, GEN *pBex)
1531 : {
1532 1390156 : GEN L, y, Vbase = bnf_get_vbase(bnf);
1533 1390156 : GEN Wex, W = bnf_get_W(bnf);
1534 1390156 : GEN Bex, B = bnf_get_B(bnf);
1535 : long p, j, i, l, nW, nB;
1536 : FACT *fact;
1537 : FB_t F;
1538 :
1539 1390156 : L = recover_partFB(&F, Vbase, lg(x)-1);
1540 1390158 : fact = (FACT*)stack_malloc((F.KC+1)*sizeof(FACT));
1541 1390158 : y = SPLIT(&F, bnf_get_nf(bnf), x, Vbase, fact);
1542 1390161 : nW = lg(W)-1; *pWex = Wex = zero_zv(nW);
1543 1390161 : nB = lg(B)-1; *pBex = Bex = zero_zv(nB); l = lg(F.FB);
1544 1390162 : p = j = 0; /* -Wall */
1545 2089974 : for (i = 1; i <= fact[0].pr; i++)
1546 : { /* decode index C = ip+j --> (p,j) */
1547 699812 : long a, b, t, C = fact[i].pr;
1548 1948184 : for (t = 1; t < l; t++)
1549 : {
1550 1860755 : long q = F.FB[t], k = C - F.iLP[q];
1551 1860755 : if (k <= 0) break;
1552 1248372 : p = q;
1553 1248372 : j = k;
1554 : }
1555 699812 : a = gel(L, p)[j];
1556 699812 : b = a - nW;
1557 699812 : if (b <= 0) Wex[a] = y? -fact[i].ex: fact[i].ex;
1558 546262 : else Bex[b] = y? -fact[i].ex: fact[i].ex;
1559 : }
1560 1390162 : return y;
1561 : }
1562 :
1563 : GEN
1564 1107799 : init_red_mod_units(GEN bnf, long prec)
1565 : {
1566 1107799 : GEN s = gen_0, p1,s1,mat, logfu = bnf_get_logfu(bnf);
1567 1107799 : long i,j, RU = lg(logfu);
1568 :
1569 1107799 : if (RU == 1) return NULL;
1570 1107799 : mat = cgetg(RU,t_MAT);
1571 2507099 : for (j=1; j<RU; j++)
1572 : {
1573 1399300 : p1 = cgetg(RU+1,t_COL); gel(mat,j) = p1;
1574 1399300 : s1 = gen_0;
1575 3465848 : for (i=1; i<RU; i++)
1576 : {
1577 2066548 : gel(p1,i) = real_i(gcoeff(logfu,i,j));
1578 2066548 : s1 = mpadd(s1, mpsqr(gel(p1,i)));
1579 : }
1580 1399300 : gel(p1,RU) = gen_0; if (mpcmp(s1,s) > 0) s = s1;
1581 : }
1582 1107799 : s = gsqrt(gmul2n(s,RU),prec);
1583 1107799 : if (expo(s) < 27) s = utoipos(1UL << 27);
1584 1107798 : return mkvec2(mat, s);
1585 : }
1586 :
1587 : /* z computed above. Return unit exponents that would reduce col (arch) */
1588 : GEN
1589 1107798 : red_mod_units(GEN col, GEN z)
1590 : {
1591 : long i,RU;
1592 : GEN x,mat,N2;
1593 :
1594 1107798 : if (!z) return NULL;
1595 1107798 : mat= gel(z,1);
1596 1107798 : N2 = gel(z,2);
1597 1107798 : RU = lg(mat); x = cgetg(RU+1,t_COL);
1598 2507097 : for (i=1; i<RU; i++) gel(x,i) = real_i(gel(col,i));
1599 1107798 : gel(x,RU) = N2;
1600 1107798 : x = lll(shallowconcat(mat,x));
1601 1107799 : if (typ(x) != t_MAT || lg(x) <= RU) return NULL;
1602 1107799 : x = gel(x,RU);
1603 1107799 : if (signe(gel(x,RU)) < 0) x = gneg_i(x);
1604 1107799 : if (!gequal1(gel(x,RU))) pari_err_BUG("red_mod_units");
1605 1107799 : setlg(x,RU); return x;
1606 : }
1607 :
1608 : static GEN
1609 2247975 : add(GEN a, GEN t) { return a = a? RgC_add(a,t): t; }
1610 :
1611 : /* [x] archimedian components, A column vector. return [x] A */
1612 : static GEN
1613 2055134 : act_arch(GEN A, GEN x)
1614 : {
1615 : GEN a;
1616 2055134 : long i,l = lg(A), tA = typ(A);
1617 2055134 : if (tA == t_MAT)
1618 : { /* assume lg(x) >= l */
1619 192332 : a = cgetg(l, t_MAT);
1620 282179 : for (i=1; i<l; i++) gel(a,i) = act_arch(gel(A,i), x);
1621 192334 : return a;
1622 : }
1623 1862802 : if (l==1) return cgetg(1, t_COL);
1624 1862802 : a = NULL;
1625 1862802 : if (tA == t_VECSMALL)
1626 : {
1627 7190126 : for (i=1; i<l; i++)
1628 : {
1629 5960804 : long c = A[i];
1630 5960804 : if (c) a = add(a, gmulsg(c, gel(x,i)));
1631 : }
1632 : }
1633 : else
1634 : { /* A a t_COL of t_INT. Assume lg(A)==lg(x) */
1635 1383860 : for (i=1; i<l; i++)
1636 : {
1637 750389 : GEN c = gel(A,i);
1638 750389 : if (signe(c)) a = add(a, gmul(c, gel(x,i)));
1639 : }
1640 : }
1641 1862793 : return a? a: zerocol(lgcols(x)-1);
1642 : }
1643 : /* act_arch(matdiagonal(v), x) */
1644 : static GEN
1645 64112 : diagact_arch(GEN v, GEN x)
1646 : {
1647 64112 : long i, l = lg(v);
1648 64112 : GEN a = cgetg(l, t_MAT);
1649 92959 : for (i = 1; i < l; i++) gel(a,i) = gmul(gel(x,i), gel(v,i));
1650 64112 : return a;
1651 : }
1652 :
1653 : static long
1654 1408352 : prec_arch(GEN bnf)
1655 : {
1656 1408352 : GEN a = bnf_get_C(bnf);
1657 1408352 : long i, l = lg(a), prec;
1658 :
1659 1408352 : for (i=1; i<l; i++)
1660 1408268 : if ( (prec = gprecision(gel(a,i))) ) return prec;
1661 84 : return DEFAULTPREC;
1662 : }
1663 :
1664 : static long
1665 3849 : needed_bitprec(GEN x)
1666 : {
1667 3849 : long i, e = 0, l = lg(x);
1668 22512 : for (i = 1; i < l; i++)
1669 : {
1670 18663 : GEN c = gel(x,i);
1671 18663 : long f = gexpo(c) - gprecision(c);
1672 18663 : if (f > e) e = f;
1673 : }
1674 3849 : return e;
1675 : }
1676 :
1677 : /* col = archimedian components of x, Nx its norm, dx a multiple of its
1678 : * denominator. Return x or NULL (fail) */
1679 : GEN
1680 1234946 : isprincipalarch(GEN bnf, GEN col, GEN kNx, GEN e, GEN dx, long *pe)
1681 : {
1682 : GEN nf, x, y, logfu, s, M;
1683 1234946 : long N, prec = gprecision(col);
1684 1234947 : bnf = checkbnf(bnf); nf = bnf_get_nf(bnf); M = nf_get_M(nf);
1685 1234947 : if (!prec) prec = prec_arch(bnf);
1686 1234947 : *pe = 128;
1687 1234947 : logfu = bnf_get_logfu(bnf);
1688 1234947 : N = nf_get_degree(nf);
1689 1234947 : if (!(col = cleanarch(col,N,NULL,prec))) return NULL;
1690 1234944 : if (lg(col) > 2)
1691 : { /* reduce mod units */
1692 1107799 : GEN u, z = init_red_mod_units(bnf,prec);
1693 1107798 : if (!(u = red_mod_units(col,z))) return NULL;
1694 1107799 : col = RgC_add(col, RgM_RgC_mul(logfu, u));
1695 1107799 : if (!(col = cleanarch(col,N,NULL,prec))) return NULL;
1696 : }
1697 1234944 : s = divru(mulir(e, glog(kNx,prec)), N);
1698 1234940 : col = fixarch(col, s, nf_get_r1(nf));
1699 1234944 : if (RgC_expbitprec(col) >= 0) return NULL;
1700 1234371 : col = gexp(col, prec);
1701 : /* d.alpha such that x = alpha \prod gj^ej */
1702 1234373 : x = RgM_solve_realimag(M,col); if (!x) return NULL;
1703 1234370 : x = RgC_Rg_mul(x, dx);
1704 1234369 : y = grndtoi(x, pe);
1705 1234366 : if (*pe > -5) { *pe = needed_bitprec(x); return NULL; }
1706 1230517 : return RgC_Rg_div(y, dx);
1707 : }
1708 :
1709 : /* y = C \prod g[i]^e[i] ? */
1710 : static int
1711 1226446 : fact_ok(GEN nf, GEN y, GEN C, GEN g, GEN e)
1712 : {
1713 1226446 : pari_sp av = avma;
1714 1226446 : long i, c = lg(e);
1715 1226446 : GEN z = C? C: gen_1;
1716 1503505 : for (i=1; i<c; i++)
1717 277059 : if (signe(gel(e,i))) z = idealmul(nf, z, idealpow(nf, gel(g,i), gel(e,i)));
1718 1226446 : if (typ(z) != t_MAT) z = idealhnf_shallow(nf,z);
1719 1226446 : if (typ(y) != t_MAT) y = idealhnf_shallow(nf,y);
1720 1226446 : return gc_bool(av, ZM_equal(y,z));
1721 : }
1722 : static GEN
1723 1390164 : ZV_divrem(GEN A, GEN B, GEN *pR)
1724 : {
1725 1390164 : long i, l = lg(A);
1726 1390164 : GEN Q = cgetg(l, t_COL), R = cgetg(l, t_COL);
1727 1896423 : for (i = 1; i < l; i++) gel(Q,i) = truedvmdii(gel(A,i), gel(B,i), &gel(R,i));
1728 1390162 : *pR = R; return Q;
1729 : }
1730 :
1731 : static GEN
1732 1390163 : Ur_ZC_mul(GEN bnf, GEN v)
1733 : {
1734 1390163 : GEN w, U = bnf_get_Ur(bnf);
1735 1390163 : long i, l = lg(bnf_get_cyc(bnf)); /* may be < lgcols(U) */
1736 :
1737 1390163 : w = cgetg(l, t_COL);
1738 1896424 : for (i = 1; i < l; i++) gel(w,i) = ZMrow_ZC_mul(U, v, i);
1739 1390163 : return w;
1740 : }
1741 :
1742 : static GEN
1743 7283 : ZV_mul(GEN x, GEN y)
1744 : {
1745 7283 : long i, l = lg(x);
1746 7283 : GEN z = cgetg(l, t_COL);
1747 31780 : for (i = 1; i < l; i++) gel(z,i) = mulii(gel(x,i), gel(y,i));
1748 7283 : return z;
1749 : }
1750 : static int
1751 1225898 : dump_gen(GEN SUnits, GEN x, long flag)
1752 : {
1753 : GEN d;
1754 : long e;
1755 1225898 : if (!(flag & nf_GENMAT) || !SUnits) return 0;
1756 272946 : e = gexpo(gel(SUnits,2)); if (e > 64) return 0; /* U large */
1757 272851 : x = Q_remove_denom(x, &d);
1758 272850 : return (d && expi(d) > 32) || gexpo(x) > 32;
1759 : }
1760 :
1761 : /* assume x in HNF; cf class_group_gen for notations. Return NULL iff
1762 : * flag & nf_FORCE and computation of principal ideal generator fails */
1763 : static GEN
1764 1406543 : isprincipalall(GEN bnf, GEN x, long *pprec, long flag)
1765 : {
1766 : GEN xar, Wex, Bex, gen, xc, col, A, Q, R, UA, SUnits;
1767 1406543 : GEN C = bnf_get_C(bnf), nf = bnf_get_nf(bnf), cyc = bnf_get_cyc(bnf);
1768 : long nB, nW, e;
1769 :
1770 1406543 : if (lg(cyc) == 1 && !(flag & (nf_GEN|nf_GENMAT|nf_GEN_IF_PRINCIPAL)))
1771 4732 : return cgetg(1,t_COL);
1772 1401811 : if (lg(x) == 2)
1773 : { /* nf = Q */
1774 84 : col = gel(x,1);
1775 84 : if (flag & nf_GENMAT) col = Q_to_famat(gel(col,1));
1776 84 : return (flag & nf_GEN_IF_PRINCIPAL)? col: mkvec2(cgetg(1,t_COL), col);
1777 : }
1778 :
1779 1401727 : x = Q_primitive_part(x, &xc);
1780 1401719 : if (equali1(gcoeff(x,1,1))) /* trivial ideal */
1781 : {
1782 11563 : R = zerocol(lg(cyc)-1);
1783 11563 : if (!(flag & (nf_GEN|nf_GENMAT|nf_GEN_IF_PRINCIPAL))) return R;
1784 11514 : if (flag & nf_GEN_IF_PRINCIPAL)
1785 6467 : return scalarcol_shallow(xc? xc: gen_1, nf_get_degree(nf));
1786 5047 : if (flag & nf_GENMAT)
1787 2191 : col = xc? Q_to_famat(xc): trivial_fact();
1788 : else
1789 2856 : col = scalarcol_shallow(xc? xc: gen_1, nf_get_degree(nf));
1790 5047 : return mkvec2(R, col);
1791 : }
1792 1390156 : xar = split_ideal(bnf, x, &Wex, &Bex);
1793 : /* x = g_W Wex + g_B Bex + [xar] = g_W (Wex - B*Bex) + [xar] + [C_B]Bex */
1794 1390162 : A = zc_to_ZC(Wex); nB = lg(Bex)-1;
1795 1390163 : if (nB) A = ZC_sub(A, ZM_zc_mul(bnf_get_B(bnf), Bex));
1796 1390163 : UA = Ur_ZC_mul(bnf, A);
1797 1390164 : Q = ZV_divrem(UA, cyc, &R);
1798 : /* g_W (Wex - B*Bex) = G Ur A - [ga]A = G R + [GD]Q - [ga]A
1799 : * Finally: x = G R + [xar] + [C_B]Bex + [GD]Q - [ga]A */
1800 1390162 : if (!(flag & (nf_GEN|nf_GENMAT|nf_GEN_IF_PRINCIPAL))) return R;
1801 1229936 : if ((flag & nf_GEN_IF_PRINCIPAL) && !ZV_equal0(R)) return gen_0;
1802 :
1803 1229929 : nW = lg(Wex)-1;
1804 1229929 : gen = bnf_get_gen(bnf);
1805 1229930 : col = NULL;
1806 1229930 : SUnits = bnf_get_sunits(bnf);
1807 1229930 : if (lg(R) == 1
1808 272410 : || abscmpiu(gel(R,vecindexmax(R)), 4 * (*pprec)) < 0)
1809 : { /* q = N (x / prod gj^ej) = N(alpha), denom(alpha) | d */
1810 1229333 : GEN d, q = gdiv(ZM_det_triangular(x), get_norm_fact(gen, R, &d));
1811 1229328 : col = xar? nf_cxlog(nf, xar, *pprec): NULL;
1812 1229332 : if (nB) col = add(col, act_arch(Bex, nW? vecslice(C,nW+1,lg(C)-1): C));
1813 1229332 : if (nW) col = add(col, RgC_sub(act_arch(Q, bnf_get_GD(bnf)),
1814 : act_arch(A, bnf_get_ga(bnf))));
1815 1229332 : col = isprincipalarch(bnf, col, q, gen_1, d, &e);
1816 1229333 : if (col && (dump_gen(SUnits, col, flag)
1817 1225897 : || !fact_ok(nf,x, col,gen,R))) col = NULL;
1818 : }
1819 1229927 : if (!col && (flag & nf_GENMAT))
1820 : {
1821 8024 : if (SUnits)
1822 : {
1823 7535 : GEN X = gel(SUnits,1), U = gel(SUnits,2), C = gel(SUnits,3);
1824 7535 : GEN v = gel(bnf,9), Ge = gel(v,4), M1 = gel(v,5), M2 = gel(v,6);
1825 7535 : GEN z = NULL, F = NULL;
1826 7535 : if (nB)
1827 : {
1828 7535 : GEN C2 = nW? vecslice(C, nW+1, lg(C)-1): C;
1829 7535 : z = ZM_zc_mul(C2, Bex);
1830 : }
1831 7535 : if (nW)
1832 : { /* [GD]Q - [ga]A = ([X]M1 - [Ge]D) Q - ([X]M2 - [Ge]Ur) A */
1833 7283 : GEN C1 = vecslice(C, 1, nW);
1834 7283 : GEN v = ZC_sub(ZM_ZC_mul(M1,Q), ZM_ZC_mul(M2,A));
1835 7283 : z = add(z, ZM_ZC_mul(C1, v));
1836 7283 : F = famat_reduce(famatV_factorback(Ge, ZC_sub(UA, ZV_mul(cyc,Q))));
1837 7283 : if (lgcols(F) == 1) F = NULL;
1838 : }
1839 : /* reduce modulo units and Q^* */
1840 7535 : if (lg(U) != 1) z = ZC_sub(z, ZM_ZC_mul(U, RgM_Babai(U,z)));
1841 7535 : col = mkmat2(X, z);
1842 7535 : if (F) col = famat_mul_shallow(col, F);
1843 7535 : col = famat_remove_trivial(col);
1844 7535 : if (xar) col = famat_mul_shallow(col, xar);
1845 : }
1846 489 : else if (!ZV_equal0(R))
1847 : { /* in case isprincipalfact calls bnfinit() due to prec trouble...*/
1848 483 : GEN y = isprincipalfact(bnf, x, gen, ZC_neg(R), flag);
1849 483 : if (typ(y) != t_VEC) return y;
1850 483 : col = gel(y,2);
1851 : }
1852 : }
1853 1229927 : if (col)
1854 : { /* add back missing content */
1855 1229837 : if (typ(col) == t_MAT)
1856 8018 : { if (xc) col = famat_mul_shallow(col, xc); }
1857 1221819 : else if (flag & nf_GENMAT)
1858 : {
1859 : GEN c;
1860 1208120 : if (RgV_isscalar(col))
1861 3664 : col = Q_to_famat(mul_content(xc, gel(col,1)));
1862 : else
1863 : {
1864 1204455 : col = Q_primitive_part(col, &c);
1865 1204452 : col = to_famat_shallow(col, gen_1);
1866 1204454 : xc = mul_content(xc, c);
1867 1204454 : if (xc) col = famat_mul(col, Q_to_famat(xc));
1868 : }
1869 : }
1870 : else
1871 13699 : { if (xc) col = RgC_Rg_mul(col,xc); }
1872 : }
1873 : else
1874 : {
1875 90 : if (e < 0) e = 0;
1876 90 : *pprec += nbits2extraprec(e + 128);
1877 90 : if (flag & nf_FORCE)
1878 : {
1879 76 : if (DEBUGLEVEL)
1880 0 : pari_warn(warner,"precision too low for generators, e = %ld",e);
1881 76 : return NULL;
1882 : }
1883 14 : pari_warn(warner,"precision too low for generators, not given");
1884 14 : col = cgetg(1, t_COL);
1885 : }
1886 1229848 : return (flag & nf_GEN_IF_PRINCIPAL)? col: mkvec2(R, col);
1887 : }
1888 :
1889 : static GEN
1890 464583 : triv_gen(GEN bnf, GEN x, long flag)
1891 : {
1892 464583 : pari_sp av = avma;
1893 464583 : GEN nf = bnf_get_nf(bnf);
1894 : long c;
1895 464583 : if (flag & nf_GEN_IF_PRINCIPAL)
1896 : {
1897 7 : if (!(flag & nf_GENMAT)) return algtobasis(nf,x);
1898 7 : x = nf_to_scalar_or_basis(nf,x);
1899 7 : if (typ(x) == t_INT && is_pm1(x)) return trivial_fact();
1900 0 : return gc_GEN(av, to_famat_shallow(x, gen_1));
1901 : }
1902 464576 : c = lg(bnf_get_cyc(bnf)) - 1;
1903 464576 : if (flag & nf_GENMAT)
1904 454972 : retmkvec2(zerocol(c), to_famat_shallow(algtobasis(nf,x), gen_1));
1905 9604 : if (flag & nf_GEN)
1906 28 : retmkvec2(zerocol(c), algtobasis(nf,x));
1907 9576 : return zerocol(c);
1908 : }
1909 :
1910 : GEN
1911 1838868 : bnfisprincipal0(GEN bnf,GEN x,long flag)
1912 : {
1913 1838868 : pari_sp av = avma;
1914 : GEN c, nf;
1915 : long pr;
1916 :
1917 1838868 : bnf = checkbnf(bnf);
1918 1838866 : nf = bnf_get_nf(bnf);
1919 1838866 : switch( idealtyp(&x, NULL) )
1920 : {
1921 59080 : case id_PRINCIPAL:
1922 59080 : if (gequal0(x)) pari_err_DOMAIN("bnfisprincipal","ideal","=",gen_0,x);
1923 59080 : return triv_gen(bnf, x, flag);
1924 1756149 : case id_PRIME:
1925 1756149 : if (pr_is_inert(x)) return triv_gen(bnf, pr_get_p(x), flag);
1926 1350653 : x = pr_hnf(nf, x);
1927 1350655 : break;
1928 23639 : case id_MAT:
1929 23639 : if (lg(x)==1) pari_err_DOMAIN("bnfisprincipal","ideal","=",gen_0,x);
1930 23639 : if (nf_get_degree(nf) != lg(x)-1)
1931 0 : pari_err_TYPE("idealtyp [dimension != degree]", x);
1932 : }
1933 1374291 : pr = prec_arch(bnf); /* precision of unit matrix */
1934 1374294 : c = getrand();
1935 : for (;;)
1936 6 : {
1937 1374300 : pari_sp av1 = avma;
1938 1374300 : GEN y = isprincipalall(bnf,x,&pr,flag);
1939 1374293 : if (y) return gc_GEN(av, y);
1940 :
1941 6 : if (DEBUGLEVEL) pari_warn(warnprec,"isprincipal",pr);
1942 6 : set_avma(av1); bnf = bnfnewprec_shallow(bnf,pr); setrand(c);
1943 : }
1944 : }
1945 : GEN
1946 174534 : isprincipal(GEN bnf,GEN x) { return bnfisprincipal0(bnf,x,0); }
1947 :
1948 : /* FIXME: OBSOLETE */
1949 : GEN
1950 0 : isprincipalgen(GEN bnf,GEN x)
1951 0 : { return bnfisprincipal0(bnf,x,nf_GEN); }
1952 : GEN
1953 0 : isprincipalforce(GEN bnf,GEN x)
1954 0 : { return bnfisprincipal0(bnf,x,nf_FORCE); }
1955 : GEN
1956 0 : isprincipalgenforce(GEN bnf,GEN x)
1957 0 : { return bnfisprincipal0(bnf,x,nf_GEN | nf_FORCE); }
1958 :
1959 : /* lg(u) > 1 */
1960 : static int
1961 105 : RgV_is1(GEN u) { return isint1(gel(u,1)) && RgV_isscalar(u); }
1962 : static GEN
1963 32172 : add_principal_part(GEN nf, GEN u, GEN v, long flag)
1964 : {
1965 32172 : if (flag & nf_GENMAT)
1966 14540 : return (typ(u) == t_COL && RgV_is1(u))? v: famat_mul_shallow(v,u);
1967 : else
1968 17632 : return nfmul(nf, v, u);
1969 : }
1970 :
1971 : #if 0
1972 : /* compute C prod P[i]^e[i], e[i] >=0 for all i. C may be NULL (omitted)
1973 : * e destroyed ! */
1974 : static GEN
1975 : expand(GEN nf, GEN C, GEN P, GEN e)
1976 : {
1977 : long i, l = lg(e), done = 1;
1978 : GEN id = C;
1979 : for (i=1; i<l; i++)
1980 : {
1981 : GEN ei = gel(e,i);
1982 : if (signe(ei))
1983 : {
1984 : if (mod2(ei)) id = id? idealmul(nf, id, gel(P,i)): gel(P,i);
1985 : ei = shifti(ei,-1);
1986 : if (signe(ei)) done = 0;
1987 : gel(e,i) = ei;
1988 : }
1989 : }
1990 : if (id != C) id = idealred(nf, id);
1991 : if (done) return id;
1992 : return idealmulred(nf, id, idealsqr(nf, expand(nf,id,P,e)));
1993 : }
1994 : /* C is an extended ideal, possibly with C[1] = NULL */
1995 : static GEN
1996 : expandext(GEN nf, GEN C, GEN P, GEN e)
1997 : {
1998 : long i, l = lg(e), done = 1;
1999 : GEN A = gel(C,1);
2000 : for (i=1; i<l; i++)
2001 : {
2002 : GEN ei = gel(e,i);
2003 : if (signe(ei))
2004 : {
2005 : if (mod2(ei)) A = A? idealmul(nf, A, gel(P,i)): gel(P,i);
2006 : ei = shifti(ei,-1);
2007 : if (signe(ei)) done = 0;
2008 : gel(e,i) = ei;
2009 : }
2010 : }
2011 : if (A == gel(C,1))
2012 : A = C;
2013 : else
2014 : A = idealred(nf, mkvec2(A, gel(C,2)));
2015 : if (done) return A;
2016 : return idealmulred(nf, A, idealsqr(nf, expand(nf,A,P,e)));
2017 : }
2018 : #endif
2019 :
2020 : static GEN
2021 0 : expand(GEN nf, GEN C, GEN P, GEN e)
2022 : {
2023 0 : long i, l = lg(e);
2024 0 : GEN B, A = C;
2025 0 : for (i=1; i<l; i++) /* compute prod P[i]^e[i] */
2026 0 : if (signe(gel(e,i)))
2027 : {
2028 0 : B = idealpowred(nf, gel(P,i), gel(e,i));
2029 0 : A = A? idealmulred(nf,A,B): B;
2030 : }
2031 0 : return A;
2032 : }
2033 : static GEN
2034 32194 : expandext(GEN nf, GEN C, GEN P, GEN e)
2035 : {
2036 32194 : long i, l = lg(e);
2037 32194 : GEN B, A = gel(C,1), C1 = A;
2038 95220 : for (i=1; i<l; i++) /* compute prod P[i]^e[i] */
2039 63026 : if (signe(gel(e,i)))
2040 : {
2041 35216 : gel(C,1) = gel(P,i);
2042 35216 : B = idealpowred(nf, C, gel(e,i));
2043 35216 : A = A? idealmulred(nf,A,B): B;
2044 : }
2045 32194 : return A == C1? C: A;
2046 : }
2047 :
2048 : /* isprincipal for C * \prod P[i]^e[i] (C omitted if NULL) */
2049 : GEN
2050 32194 : isprincipalfact(GEN bnf, GEN C, GEN P, GEN e, long flag)
2051 : {
2052 32194 : const long gen = flag & (nf_GEN|nf_GENMAT|nf_GEN_IF_PRINCIPAL);
2053 : long prec;
2054 32194 : pari_sp av = avma;
2055 32194 : GEN C0, Cext, c, id, nf = bnf_get_nf(bnf);
2056 :
2057 32194 : if (gen)
2058 : {
2059 14547 : Cext = (flag & nf_GENMAT)? trivial_fact()
2060 32194 : : mkpolmod(gen_1,nf_get_pol(nf));
2061 32194 : C0 = mkvec2(C, Cext);
2062 32194 : id = expandext(nf, C0, P, e);
2063 : } else {
2064 0 : Cext = NULL;
2065 0 : C0 = C;
2066 0 : id = expand(nf, C, P, e);
2067 : }
2068 32194 : if (id == C0) /* e = 0 */
2069 : {
2070 12477 : if (!C) return bnfisprincipal0(bnf, gen_1, flag);
2071 12463 : switch(typ(C))
2072 : {
2073 7 : case t_INT: case t_FRAC: case t_POL: case t_POLMOD: case t_COL:
2074 7 : return triv_gen(bnf, C, flag);
2075 : }
2076 12456 : C = idealhnf_shallow(nf,C);
2077 : }
2078 : else
2079 : {
2080 19717 : if (gen) { C = gel(id,1); Cext = gel(id,2); } else C = id;
2081 : }
2082 32173 : prec = prec_arch(bnf);
2083 32173 : c = getrand();
2084 : for (;;)
2085 70 : {
2086 32243 : pari_sp av1 = avma;
2087 32243 : GEN y = isprincipalall(bnf, C, &prec, flag);
2088 32242 : if (y)
2089 : {
2090 32172 : if (flag & nf_GEN_IF_PRINCIPAL)
2091 : {
2092 20817 : if (typ(y) == t_INT) return gc_NULL(av);
2093 20817 : y = add_principal_part(nf, y, Cext, flag);
2094 : }
2095 : else
2096 : {
2097 11355 : GEN u = gel(y,2);
2098 11355 : if (!gen || typ(y) != t_VEC) return gc_upto(av,y);
2099 11355 : if (lg(u) != 1) gel(y,2) = add_principal_part(nf, u, Cext, flag);
2100 : }
2101 32171 : return gc_GEN(av, y);
2102 : }
2103 70 : if (DEBUGLEVEL) pari_warn(warnprec,"isprincipal",prec);
2104 70 : set_avma(av1); bnf = bnfnewprec_shallow(bnf,prec); setrand(c);
2105 : }
2106 : }
2107 : GEN
2108 0 : isprincipalfact_or_fail(GEN bnf, GEN C, GEN P, GEN e)
2109 : {
2110 0 : const long flag = nf_GENMAT|nf_FORCE;
2111 : long prec;
2112 0 : pari_sp av = avma;
2113 0 : GEN u, y, id, C0, Cext, nf = bnf_get_nf(bnf);
2114 :
2115 0 : Cext = trivial_fact();
2116 0 : C0 = mkvec2(C, Cext);
2117 0 : id = expandext(nf, C0, P, e);
2118 0 : if (id == C0) /* e = 0 */
2119 0 : C = idealhnf_shallow(nf,C);
2120 : else {
2121 0 : C = gel(id,1); Cext = gel(id,2);
2122 : }
2123 0 : prec = prec_arch(bnf);
2124 0 : y = isprincipalall(bnf, C, &prec, flag);
2125 0 : if (!y) return gc_utoipos(av, prec);
2126 0 : u = gel(y,2);
2127 0 : if (lg(u) != 1) gel(y,2) = add_principal_part(nf, u, Cext, flag);
2128 0 : return gc_GEN(av, y);
2129 : }
2130 :
2131 : GEN
2132 162318 : nfsign_from_logarch(GEN LA, GEN invpi, GEN archp)
2133 : {
2134 162318 : long l = lg(archp), i;
2135 162318 : GEN y = cgetg(l, t_VECSMALL);
2136 162320 : pari_sp av = avma;
2137 :
2138 310060 : for (i=1; i<l; i++)
2139 : {
2140 147737 : GEN c = ground( gmul(imag_i(gel(LA,archp[i])), invpi) );
2141 147740 : y[i] = mpodd(c)? 1: 0;
2142 : }
2143 162323 : set_avma(av); return y;
2144 : }
2145 :
2146 : GEN
2147 239983 : nfsign_tu(GEN bnf, GEN archp)
2148 : {
2149 : long n;
2150 239983 : if (bnf_get_tuN(bnf) != 2) return cgetg(1, t_VECSMALL);
2151 172875 : n = archp? lg(archp) - 1: nf_get_r1(bnf_get_nf(bnf));
2152 172875 : return const_vecsmall(n, 1);
2153 : }
2154 : GEN
2155 241157 : nfsign_fu(GEN bnf, GEN archp)
2156 : {
2157 241157 : GEN invpi, y, A = bnf_get_logfu(bnf), nf = bnf_get_nf(bnf);
2158 241155 : long j = 1, RU = lg(A);
2159 :
2160 241155 : if (!archp) archp = identity_perm( nf_get_r1(nf) );
2161 241155 : invpi = invr( mppi(nf_get_prec(nf)) );
2162 241141 : y = cgetg(RU,t_MAT);
2163 403376 : for (j = 1; j < RU; j++)
2164 162220 : gel(y,j) = nfsign_from_logarch(gel(A,j), invpi, archp);
2165 241156 : return y;
2166 : }
2167 : GEN
2168 35 : nfsign_units(GEN bnf, GEN archp, int add_zu)
2169 : {
2170 35 : GEN sfu = nfsign_fu(bnf, archp);
2171 35 : return add_zu? vec_prepend(sfu, nfsign_tu(bnf, archp)): sfu;
2172 : }
2173 :
2174 : /* obsolete */
2175 : GEN
2176 7 : signunits(GEN bnf)
2177 : {
2178 : pari_sp av;
2179 : GEN S, y, nf;
2180 : long i, j, r1, r2;
2181 :
2182 7 : bnf = checkbnf(bnf); nf = bnf_get_nf(bnf);
2183 7 : nf_get_sign(nf, &r1,&r2);
2184 7 : S = zeromatcopy(r1, r1+r2-1); av = avma;
2185 7 : y = nfsign_fu(bnf, NULL);
2186 14 : for (j = 1; j < lg(y); j++)
2187 : {
2188 7 : GEN Sj = gel(S,j), yj = gel(y,j);
2189 21 : for (i = 1; i <= r1; i++) gel(Sj,i) = yj[i]? gen_m1: gen_1;
2190 : }
2191 7 : set_avma(av); return S;
2192 : }
2193 :
2194 : static GEN
2195 725457 : get_log_embed(REL_t *rel, GEN M, long RU, long R1, long prec)
2196 : {
2197 725457 : GEN arch, C, z = rel->m;
2198 : long i;
2199 725457 : arch = typ(z) == t_COL? RgM_RgC_mul(M, z): const_col(nbrows(M), z);
2200 725451 : C = cgetg(RU+1, t_COL); arch = glog(arch, prec);
2201 1653949 : for (i=1; i<=R1; i++) gel(C,i) = gel(arch,i);
2202 1563636 : for ( ; i<=RU; i++) gel(C,i) = gmul2n(gel(arch,i), 1);
2203 725450 : return C;
2204 : }
2205 : static GEN
2206 1016315 : rel_embed(REL_t *rel, FB_t *F, GEN embs, long ind, GEN M, long RU, long R1,
2207 : long prec)
2208 : {
2209 : GEN C, D, perm;
2210 : long i, n;
2211 1016315 : if (!rel->relaut) return get_log_embed(rel, M, RU, R1, prec);
2212 : /* image of another relation by automorphism */
2213 290862 : C = gel(embs, ind - rel->relorig);
2214 290862 : perm = gel(F->embperm, rel->relaut);
2215 290862 : D = cgetg_copy(C, &n);
2216 1217603 : for (i = 1; i < n; i++)
2217 : {
2218 926737 : long v = perm[i];
2219 926737 : gel(D,i) = (v > 0)? gel(C,v): conj_i(gel(C,-v));
2220 : }
2221 290866 : return D;
2222 : }
2223 : static GEN
2224 122380 : get_embs(FB_t *F, RELCACHE_t *cache, GEN nf, GEN embs, long PREC)
2225 : {
2226 122380 : long ru, j, k, l = cache->last - cache->chk + 1, r1 = nf_get_r1(nf);
2227 122380 : GEN M = nf_get_M(nf), nembs = cgetg(cache->last - cache->base+1, t_MAT);
2228 : REL_t *rel;
2229 :
2230 1509768 : for (k = 1; k <= cache->chk - cache->base; k++) gel(nembs,k) = gel(embs,k);
2231 122380 : embs = nembs; ru = nbrows(M);
2232 1126117 : for (j=1,rel = cache->chk + 1; j < l; rel++,j++,k++)
2233 1003740 : gel(embs,k) = rel_embed(rel, F, embs, k, M, ru, r1, PREC);
2234 122377 : return embs;
2235 : }
2236 : static void
2237 947640 : set_rel_alpha(REL_t *rel, GEN auts, GEN vA, long ind)
2238 : {
2239 : GEN u;
2240 947640 : if (!rel->relaut)
2241 674031 : u = rel->m;
2242 : else
2243 273609 : u = ZM_ZC_mul(gel(auts, rel->relaut), gel(vA, ind - rel->relorig));
2244 947640 : gel(vA, ind) = u;
2245 947640 : }
2246 : static GEN
2247 2253754 : set_fact(FB_t *F, FACT *fact, GEN e, long *pnz)
2248 : {
2249 2253754 : long i, n = fact[0].pr, nz = F->KC + 1;
2250 2253754 : GEN c = zero_Flv(F->KC);
2251 10548821 : for (i = 1; i <= n; i++)
2252 : {
2253 8295056 : long p = fact[i].pr;
2254 8295056 : if (p < nz) nz = p;
2255 8295056 : c[p] = fact[i].ex;
2256 : }
2257 2253765 : if (e)
2258 : {
2259 114382 : long l = lg(e);
2260 333749 : for (i = 1; i < l; i++)
2261 219367 : if (e[i]) { long v = F->subFB[i]; c[v] += e[i]; if (v < nz) nz = v; }
2262 : }
2263 2253765 : *pnz = nz; return c;
2264 : }
2265 :
2266 : /* Is cols already in the cache ? bs = index of first non zero coeff in cols
2267 : * General check for colinearity useless since exceedingly rare */
2268 : static int
2269 2905807 : already_known(RELCACHE_t *cache, long bs, GEN cols)
2270 : {
2271 : REL_t *r;
2272 2905807 : long l = lg(cols);
2273 215164568 : for (r = cache->last; r > cache->base; r--)
2274 212748134 : if (bs == r->nz)
2275 : {
2276 34174826 : GEN coll = r->R;
2277 34174826 : long b = bs;
2278 122042543 : while (b < l && cols[b] == coll[b]) b++;
2279 34174826 : if (b == l) return 1;
2280 : }
2281 2416434 : return 0;
2282 : }
2283 :
2284 : /* Add relation R to cache, nz = index of first non zero coeff in R.
2285 : * If relation is a linear combination of the previous ones, return 0.
2286 : * Otherwise, update basis and return > 0. Compute mod p (much faster)
2287 : * so some kernel vector might not be genuine. */
2288 : static int
2289 2909955 : add_rel_i(RELCACHE_t *cache, GEN R, long nz, GEN m, long orig, long aut, REL_t **relp, long in_rnd_rel)
2290 : {
2291 2909955 : long i, k, n = lg(R)-1;
2292 :
2293 2909955 : if (nz == n+1) { k = 0; goto ADD_REL; }
2294 2905801 : if (already_known(cache, nz, R)) return -1;
2295 2416496 : if (cache->last >= cache->base + cache->len) return 0;
2296 2416496 : if (DEBUGLEVEL>6)
2297 : {
2298 0 : err_printf("adding vector = %Ps\n",R);
2299 0 : err_printf("generators =\n%Ps\n", cache->basis);
2300 : }
2301 2416523 : if (cache->missing)
2302 : {
2303 2020243 : GEN a = leafcopy(R), basis = cache->basis;
2304 2020239 : k = lg(a);
2305 124367398 : do --k; while (!a[k]);
2306 7084939 : while (k)
2307 : {
2308 5533564 : GEN c = gel(basis, k);
2309 5533564 : if (c[k])
2310 : {
2311 5064700 : long ak = a[k];
2312 263110233 : for (i=1; i < k; i++) if (c[i]) a[i] = (a[i] + ak*(mod_p-c[i])) % mod_p;
2313 5064700 : a[k] = 0;
2314 129167476 : do --k; while (!a[k]); /* k cannot go below 0: codeword is a sentinel */
2315 : }
2316 : else
2317 : {
2318 468864 : ulong invak = Fl_inv(uel(a,k), mod_p);
2319 : /* Cleanup a */
2320 13949830 : for (i = k; i-- > 1; )
2321 : {
2322 13480966 : long j, ai = a[i];
2323 13480966 : c = gel(basis, i);
2324 13480966 : if (!ai || !c[i]) continue;
2325 237343 : ai = mod_p-ai;
2326 4492666 : for (j = 1; j < i; j++) if (c[j]) a[j] = (a[j] + ai*c[j]) % mod_p;
2327 237343 : a[i] = 0;
2328 : }
2329 : /* Insert a/a[k] as k-th column */
2330 468864 : c = gel(basis, k);
2331 13949828 : for (i = 1; i<k; i++) if (a[i]) c[i] = (a[i] * invak) % mod_p;
2332 468864 : c[k] = 1; a = c;
2333 : /* Cleanup above k */
2334 13748666 : for (i = k+1; i<n; i++)
2335 : {
2336 : long j, ck;
2337 13279802 : c = gel(basis, i);
2338 13279802 : ck = c[k];
2339 13279802 : if (!ck) continue;
2340 2756771 : ck = mod_p-ck;
2341 99825274 : for (j = 1; j < k; j++) if (a[j]) c[j] = (c[j] + ck*a[j]) % mod_p;
2342 2756771 : c[k] = 0;
2343 : }
2344 468864 : cache->missing--;
2345 468864 : break;
2346 : }
2347 : }
2348 : }
2349 : else
2350 396280 : k = (cache->last - cache->base) + 1;
2351 2416519 : if (k || cache->relsup > 0 || (m && in_rnd_rel))
2352 : {
2353 : REL_t *rel;
2354 :
2355 988372 : ADD_REL:
2356 992526 : rel = ++cache->last;
2357 992526 : if (!k && cache->relsup && nz < n+1)
2358 : {
2359 122903 : cache->relsup--;
2360 122903 : k = (rel - cache->base) + cache->missing;
2361 : }
2362 992526 : rel->R = gclone(R);
2363 992545 : rel->m = m ? gclone(m) : NULL;
2364 992535 : rel->nz = nz;
2365 992535 : if (aut)
2366 : {
2367 288266 : rel->relorig = (rel - cache->base) - orig;
2368 288266 : rel->relaut = aut;
2369 : }
2370 : else
2371 704269 : rel->relaut = 0;
2372 992535 : if (relp) *relp = rel;
2373 992535 : if (DEBUGLEVEL) dbg_newrel(cache);
2374 : }
2375 2420677 : return k;
2376 : }
2377 :
2378 : /* m a t_INT or primitive t_COL */
2379 : static int
2380 2426547 : add_rel(RELCACHE_t *cache, FB_t *F, GEN R, long nz, GEN m, long in_rnd_rel)
2381 : {
2382 : REL_t *rel;
2383 : long k, l, reln;
2384 2426547 : const long lauts = lg(F->idealperm), KC = F->KC;
2385 :
2386 2426547 : k = add_rel_i(cache, R, nz, m, 0, 0, &rel, in_rnd_rel);
2387 2426622 : if (k > 0 && typ(m) != t_INT)
2388 : {
2389 531000 : GEN Rl = cgetg(KC+1, t_VECSMALL);
2390 530999 : reln = rel - cache->base;
2391 1014430 : for (l = 1; l < lauts; l++)
2392 : {
2393 483427 : GEN perml = gel(F->idealperm, l);
2394 483427 : long i, nzl = perml[nz];
2395 :
2396 20377502 : for (i = 1; i <= KC; i++) Rl[i] = 0;
2397 18180271 : for (i = nz; i <= KC; i++)
2398 17696844 : if (R[i])
2399 : {
2400 1283577 : long v = perml[i];
2401 :
2402 1283577 : if (v < nzl) nzl = v;
2403 1283577 : Rl[v] = R[i];
2404 : }
2405 483427 : (void)add_rel_i(cache, Rl, nzl, NULL, reln, l, NULL, in_rnd_rel);
2406 : }
2407 : }
2408 2426625 : return k;
2409 : }
2410 :
2411 : INLINE void
2412 28185765 : step(GEN x, double *y, GEN inc, long k)
2413 : {
2414 28185765 : if (!y[k])
2415 2212368 : x[k]++; /* leading coeff > 0 */
2416 : else
2417 : {
2418 25973397 : long i = inc[k];
2419 25973397 : x[k] += i;
2420 25973397 : inc[k] = (i > 0)? -1-i: 1-i;
2421 : }
2422 28185765 : }
2423 :
2424 : /* degree n >= 2 */
2425 : static double
2426 266122 : Fincke_Pohst_bound(double T, GEN r)
2427 : {
2428 266122 : pari_sp av = avma;
2429 266122 : GEN zT = dbltor(T * T), p = gmael(r,1,1), B = NULL;
2430 266114 : long i, n = lg(r)-1;
2431 266114 : double g = 0.;
2432 610882 : for (i = 2; i <= n; i++)
2433 : {
2434 610868 : p = gmul(p, gmael(r,i,i));
2435 610889 : B = sqrtnr(gmul(zT,p), i);
2436 610868 : if (i == n || cmprr(B, gmael(r,i+1,i+1)) < 0) break;
2437 : }
2438 266114 : if (!gisdouble(B,&g)) g = 0.;
2439 266109 : return gc_double(av, g);
2440 : }
2441 :
2442 : static void
2443 1978529 : fact_update(GEN R, FB_t *F, long ipr, GEN c)
2444 : {
2445 1978529 : GEN pr = gel(F->LP,ipr), p = pr_get_p(pr);
2446 1978529 : long v = Z_lval(c, itou(p));
2447 1978536 : if (v) R[ipr] -= pr_get_e(pr) * v;
2448 1978535 : }
2449 :
2450 : static long
2451 266123 : Fincke_Pohst_ideal(RELCACHE_t *cache, FB_t *F, GEN nf, GEN I, GEN NI,
2452 : FACT *fact, long Nrelid, FP_t *fp, GEN rex, long jid, long jid0, long e0,
2453 : long *Nsmall, long *Nfact)
2454 : {
2455 : pari_sp av;
2456 266123 : GEN G = nf_get_G(nf), G0 = nf_get_roundG(nf), r, u, gx, cgx, inc, ideal;
2457 266122 : long prec = nf_get_prec(nf), N = nf_get_degree(nf);
2458 266118 : long j, k, skipfirst, relid = 0, try_factor = 0;
2459 266118 : long try_elt = 0, maxtry_ELEMENT = 4*maxtry_FACT*maxtry_FACT;
2460 : double BOUND, B1, B2;
2461 :
2462 266118 : inc = const_vecsmall(N, 1);
2463 266119 : u = ZM_lll(ZM_mul(G0, I), 0.99, LLL_IM);
2464 266123 : ideal = ZM_mul(I,u); /* approximate T2-LLL reduction */
2465 266099 : r = gaussred_from_QR(RgM_mul(G, ideal), prec); /* Cholesky for T2 | ideal */
2466 266123 : if (!r) pari_err_BUG("small_norm (precision too low)");
2467 :
2468 1182269 : for (k=1; k<=N; k++)
2469 : {
2470 916146 : if (!gisdouble(gcoeff(r,k,k),&(fp->v[k]))) return 0;
2471 2721429 : for (j=1; j<k; j++) if (!gisdouble(gcoeff(r,j,k),&(fp->q[j][k]))) return 0;
2472 916145 : if (DEBUGLEVEL>3) err_printf("v[%ld]=%.4g ",k,fp->v[k]);
2473 : }
2474 266123 : B1 = fp->v[1]; /* T2(ideal[1]) */
2475 266123 : B2 = fp->v[2] + B1 * fp->q[1][2] * fp->q[1][2]; /* T2(ideal[2]) */
2476 266123 : skipfirst = ZV_isscalar(gel(ideal,1));
2477 266123 : BOUND = maxdd(2*B2, Fincke_Pohst_bound(4 * maxtry_FACT / F->ballvol, r));
2478 266108 : if (DEBUGLEVEL>1)
2479 : {
2480 0 : if (DEBUGLEVEL>3) err_printf("\n");
2481 0 : err_printf("BOUND = %.4g\n",BOUND);
2482 : }
2483 :
2484 266114 : k = N; fp->y[N] = fp->z[N] = 0; fp->x[N] = 0;
2485 18617355 : for (av = avma;; set_avma(av), step(fp->x,fp->y,inc,k))
2486 18350875 : {
2487 : GEN R;
2488 : long nz;
2489 : do
2490 : { /* look for primitive element of small norm, cf minim00 */
2491 23458282 : int fl = 0;
2492 : double p;
2493 23458282 : if (k > 1)
2494 : {
2495 5107489 : long l = k-1;
2496 5107489 : fp->z[l] = 0;
2497 45491693 : for (j=k; j<=N; j++) fp->z[l] += fp->q[l][j]*fp->x[j];
2498 5107489 : p = (double)fp->x[k] + fp->z[k];
2499 5107489 : fp->y[l] = fp->y[k] + p*p*fp->v[k];
2500 5107489 : if (l <= skipfirst && !fp->y[1]) fl = 1;
2501 5107489 : fp->x[l] = (long)floor(-fp->z[l] + 0.5);
2502 5107489 : k = l;
2503 : }
2504 4463045 : for(;; step(fp->x,fp->y,inc,k))
2505 : {
2506 27921290 : if (!fl)
2507 : {
2508 27881504 : if (++try_elt > maxtry_ELEMENT) goto END_Fincke_Pohst_ideal;
2509 27878942 : p = (double)fp->x[k] + fp->z[k];
2510 27878942 : if (fp->y[k] + p*p*fp->v[k] <= BOUND) break;
2511 :
2512 5371737 : step(fp->x,fp->y,inc,k);
2513 :
2514 5371895 : p = (double)fp->x[k] + fp->z[k];
2515 5371895 : if (fp->y[k] + p*p*fp->v[k] <= BOUND) break;
2516 : }
2517 4465607 : fl = 0; inc[k] = 1;
2518 4465607 : if (++k > N) goto END_Fincke_Pohst_ideal;
2519 : }
2520 23455841 : } while (k > 1);
2521 :
2522 : /* element complete */
2523 33592093 : if (zv_content(fp->x) !=1) continue; /* not primitive */
2524 15528971 : gx = ZM_zc_mul(ideal,fp->x);
2525 15528941 : if (ZV_isscalar(gx)) continue;
2526 15652528 : if (++try_factor > maxtry_FACT) break;
2527 :
2528 15488641 : if (DEBUGLEVEL && Nsmall) (*Nsmall)++;
2529 15488641 : if (!factorgen(F,nf,I,NI,gx,fact)) continue;
2530 2351671 : if (!Nrelid) return 1;
2531 2251995 : if (jid == jid0)
2532 28745 : add_to_fact(jid, 1 + e0, fact);
2533 : else
2534 : {
2535 2223250 : add_to_fact(jid, 1, fact);
2536 2223505 : if (jid0) add_to_fact(jid0, e0, fact);
2537 : }
2538 :
2539 : /* smooth element */
2540 2252250 : R = set_fact(F, fact, rex, &nz);
2541 2252273 : cgx = Z_content(gx);
2542 2252211 : if (cgx)
2543 : { /* relatively rare, compute relation attached to gx/cgx */
2544 485385 : long i, n = fact[0].pr;
2545 485385 : gx = Q_div_to_int(gx, cgx);
2546 2414227 : for (i = 1; i <= n; i++) fact_update(R, F, fact[i].pr, cgx);
2547 485387 : if (rex)
2548 : {
2549 32885 : long l = lg(rex);
2550 108170 : for (i = 1; i < l; i++)
2551 75285 : if (rex[i])
2552 : {
2553 73313 : long t, ipr = F->subFB[i];
2554 235186 : for (t = 1; t <= n; t++)
2555 185504 : if (fact[t].pr == ipr) break;
2556 73313 : if (t > n) fact_update(R, F, ipr, cgx);
2557 : }
2558 : }
2559 : }
2560 2252213 : if (DEBUGLEVEL && Nfact) (*Nfact)++;
2561 : /* make sure we get maximal rank first, then allow all relations */
2562 2252213 : if (add_rel(cache, F, R, nz, gx, rex? 1: 0) <= 0)
2563 : { /* probably Q-dependent from previous ones: forget it */
2564 1721757 : if (DEBUGLEVEL>1) err_printf("*");
2565 1721761 : continue;
2566 : }
2567 530541 : if (cache->last >= cache->end) return 1; /* we have enough */
2568 430879 : if (++relid == Nrelid) break;
2569 : }
2570 166449 : END_Fincke_Pohst_ideal:
2571 166449 : return 0;
2572 : }
2573 :
2574 : static void
2575 66752 : small_norm(RELCACHE_t *cache, FB_t *F, GEN nf, long Nrelid, FACT *fact, long j0)
2576 : {
2577 66752 : const long N = nf_get_degree(nf);
2578 : FP_t fp;
2579 : pari_sp av;
2580 66752 : GEN L_jid = F->L_jid, Np0 = NULL, p0 = j0? gel(F->LP,j0): NULL;
2581 66752 : long Nsmall, Nfact, n = lg(L_jid), e0 = 0;
2582 : pari_timer T;
2583 :
2584 66752 : if (DEBUGLEVEL)
2585 : {
2586 0 : timer_start(&T);
2587 0 : err_printf("#### Look for %ld relations in %ld ideals (small_norm)\n",
2588 0 : cache->end - cache->last, lg(L_jid)-1);
2589 0 : if (p0) err_printf("Look in p0 = %Ps\n", vecslice(p0,1,4));
2590 : }
2591 66752 : Nsmall = Nfact = 0;
2592 66752 : minim_alloc(N+1, &fp.q, &fp.x, &fp.y, &fp.z, &fp.v);
2593 66752 : if (p0)
2594 : {
2595 26677 : GEN n = pr_norm(p0);
2596 26677 : e0 = logint0(sqri(pr_norm(veclast(F->LP))), n, NULL);
2597 26677 : p0 = idealpows(nf, p0, e0);
2598 26677 : Np0 = powiu(n,e0);
2599 : }
2600 164711 : for (av = avma; --n; set_avma(av))
2601 : {
2602 164315 : long j = L_jid[n];
2603 164315 : GEN id = gel(F->LP, j), Nid;
2604 164315 : if (DEBUGLEVEL>1)
2605 0 : err_printf("\n*** Ideal no %ld: %Ps\n", j, vecslice(id,1,4));
2606 164315 : if (p0)
2607 : {
2608 32328 : if (j == j0)
2609 : { /* avoid trivial relation */
2610 3899 : long e = pr_get_e(id);
2611 3899 : if ((e0 + 1) % e == 0 && e * pr_get_f(id) == N) continue;
2612 : }
2613 31685 : Nid = mulii(Np0, pr_norm(id)); id = idealmul(nf, p0, id);
2614 : }
2615 : else
2616 131987 : { Nid = pr_norm(id); id = pr_hnf(nf, id);}
2617 163673 : if (Fincke_Pohst_ideal(cache, F, nf, id, Nid, fact, Nrelid, &fp,
2618 66355 : NULL, j, j0, e0, &Nsmall, &Nfact)) break;
2619 : }
2620 66752 : if (DEBUGLEVEL && Nsmall)
2621 : {
2622 0 : if (DEBUGLEVEL == 1)
2623 0 : { if (Nfact) err_printf("\n"); }
2624 : else
2625 0 : err_printf(" \nnb. fact./nb. small norm = %ld/%ld = %.3f\n",
2626 0 : Nfact,Nsmall,((double)Nfact)/Nsmall);
2627 0 : if (timer_get(&T)>1) timer_printf(&T,"small_norm");
2628 : }
2629 66752 : }
2630 :
2631 : static GEN
2632 55588 : get_random_ideal(FB_t *F, GEN nf, GEN ex)
2633 : {
2634 55588 : long i, l = lg(ex);
2635 : for (;;)
2636 1037 : {
2637 56625 : GEN I = NULL;
2638 158687 : for (i = 1; i < l; i++)
2639 102059 : if ((ex[i] = random_bits(RANDOM_BITS)))
2640 : {
2641 97808 : GEN pr = gel(F->LP, F->subFB[i]), e = utoipos(ex[i]);
2642 97808 : I = I? idealmulpowprime(nf, I, pr, e): idealpow(nf, pr, e);
2643 : }
2644 56628 : if (I && !ZM_isscalar(I,NULL)) return I; /* != (n)Z_K */
2645 : }
2646 : }
2647 :
2648 : static void
2649 55588 : rnd_rel(RELCACHE_t *cache, FB_t *F, GEN nf, FACT *fact)
2650 : {
2651 : pari_timer T;
2652 55588 : GEN L_jid = F->L_jid, R, NR, ex;
2653 55588 : long i, l = lg(L_jid), Nfact = 0;
2654 : FP_t fp;
2655 : pari_sp av;
2656 :
2657 55588 : if (DEBUGLEVEL) {
2658 0 : timer_start(&T);
2659 0 : err_printf("#### Look for %ld relations in %ld ideals (rnd_rel)\n",
2660 0 : cache->end - cache->last, l-1);
2661 : }
2662 55588 : ex = cgetg(lg(F->subFB), t_VECSMALL);
2663 55588 : R = get_random_ideal(F, nf, ex); /* random product from subFB */
2664 55590 : NR = ZM_det_triangular(R);
2665 55590 : minim_alloc(nf_get_degree(nf)+1, &fp.q, &fp.x, &fp.y, &fp.z, &fp.v);
2666 124722 : for (av = avma, i = 1; i < l; i++, set_avma(av))
2667 : { /* try P[j] * base */
2668 102437 : long j = L_jid[i];
2669 102437 : GEN P = gel(F->LP, j), Nid = mulii(NR, pr_norm(P));
2670 102429 : if (DEBUGLEVEL>1) err_printf("\n*** Ideal %ld: %Ps\n", j, vecslice(P,1,4));
2671 102429 : if (Fincke_Pohst_ideal(cache, F, nf, idealHNF_mul(nf, R, P), Nid, fact,
2672 33307 : RND_REL_RELPID, &fp, ex, j, 0, 0, NULL, &Nfact)) break;
2673 : }
2674 55592 : if (DEBUGLEVEL)
2675 : {
2676 0 : if (Nfact) err_printf("\n");
2677 0 : if (timer_get(&T)>=0) timer_printf(&T,"rnd_rel");
2678 : }
2679 55592 : }
2680 :
2681 : static GEN
2682 64015 : automorphism_perms(GEN M, GEN auts, GEN cyclic, long r1, long r2, long N)
2683 : {
2684 64015 : long L = lgcols(M), lauts = lg(auts), lcyc = lg(cyclic), i, j, l, m;
2685 64015 : GEN Mt, perms = cgetg(lauts, t_VEC);
2686 : pari_sp av;
2687 :
2688 128876 : for (l = 1; l < lauts; l++) gel(perms, l) = cgetg(L, t_VECSMALL);
2689 64014 : av = avma;
2690 64014 : Mt = shallowtrans(gprec_w(M, LOWDEFAULTPREC));
2691 64013 : Mt = shallowconcat(Mt, conj_i(vecslice(Mt, r1+1, r1+r2)));
2692 111495 : for (l = 1; l < lcyc; l++)
2693 : {
2694 47481 : GEN thiscyc = gel(cyclic, l), thisperm, perm, prev, Nt;
2695 47481 : long k = thiscyc[1];
2696 :
2697 47481 : Nt = RgM_mul(shallowtrans(gel(auts, k)), Mt);
2698 47478 : perm = gel(perms, k);
2699 157338 : for (i = 1; i < L; i++)
2700 : {
2701 109858 : GEN v = gel(Nt, i), minD;
2702 109858 : minD = gnorml2(gsub(v, gel(Mt, 1)));
2703 109858 : perm[i] = 1;
2704 577339 : for (j = 2; j <= N; j++)
2705 : {
2706 467479 : GEN D = gnorml2(gsub(v, gel(Mt, j)));
2707 467477 : if (gcmp(D, minD) < 0) { minD = D; perm[i] = j >= L ? r2-j : j; }
2708 : }
2709 : }
2710 66093 : for (prev = perm, m = 2; m < lg(thiscyc); m++, prev = thisperm)
2711 : {
2712 18613 : thisperm = gel(perms, thiscyc[m]);
2713 94360 : for (i = 1; i < L; i++)
2714 : {
2715 75747 : long pp = labs(prev[i]);
2716 75747 : thisperm[i] = prev[i] < 0 ? -perm[pp] : perm[pp];
2717 : }
2718 : }
2719 : }
2720 64014 : set_avma(av); return perms;
2721 : }
2722 :
2723 : /* Determine the field automorphisms as matrices on the integral basis */
2724 : static GEN
2725 64074 : automorphism_matrices(GEN nf, GEN *cycp)
2726 : {
2727 64074 : pari_sp av = avma;
2728 64074 : GEN auts = galoisconj(nf, NULL), mats, cyclic, cyclicidx;
2729 64075 : long nauts = lg(auts)-1, i, j, k, l;
2730 :
2731 64075 : cyclic = cgetg(nauts+1, t_VEC);
2732 64075 : cyclicidx = zero_Flv(nauts);
2733 98499 : for (l = 1; l <= nauts; l++)
2734 : {
2735 98499 : GEN aut = gel(auts, l);
2736 98499 : if (gequalX(aut)) { swap(gel(auts, l), gel(auts, nauts)); break; }
2737 : }
2738 : /* trivial automorphism is last */
2739 193038 : for (l = 1; l <= nauts; l++) gel(auts, l) = algtobasis(nf, gel(auts, l));
2740 : /* Compute maximal cyclic subgroups */
2741 128965 : for (l = nauts; --l > 0; ) if (!cyclicidx[l])
2742 : {
2743 48985 : GEN elt = gel(auts, l), aut = elt, cyc = cgetg(nauts+1, t_VECSMALL);
2744 48985 : cyc[1] = cyclicidx[l] = l; j = 1;
2745 : do
2746 : {
2747 68142 : elt = galoisapply(nf, elt, aut);
2748 221729 : for (k = 1; k <= nauts; k++) if (gequal(elt, gel(auts, k))) break;
2749 68142 : cyclicidx[k] = l; cyc[++j] = k;
2750 : }
2751 68142 : while (k != nauts);
2752 48985 : setlg(cyc, j);
2753 48985 : gel(cyclic, l) = cyc;
2754 : }
2755 128965 : for (i = j = 1; i < nauts; i++)
2756 64889 : if (cyclicidx[i] == i) cyclic[j++] = cyclic[i];
2757 64076 : setlg(cyclic, j);
2758 64075 : mats = cgetg(nauts, t_VEC);
2759 111584 : while (--j > 0)
2760 : {
2761 47508 : GEN cyc = gel(cyclic, j);
2762 47508 : long id = cyc[1];
2763 47508 : GEN M, Mi, aut = gel(auts, id);
2764 :
2765 47508 : gel(mats, id) = Mi = M = nfgaloismatrix(nf, aut);
2766 66121 : for (i = 2; i < lg(cyc); i++) gel(mats, cyc[i]) = Mi = ZM_mul(Mi, M);
2767 : }
2768 64076 : (void)gc_all(av, 2, &mats, &cyclic);
2769 64078 : if (cycp) *cycp = cyclic;
2770 64078 : return mats;
2771 : }
2772 :
2773 : /* vP a list of maximal ideals above the same p from idealprimedec: f(P/p) is
2774 : * increasing; 1 <= j <= #vP; orbit a zc of length <= #vP; auts a vector of
2775 : * automorphisms in ZM form.
2776 : * Set orbit[i] = 1 for all vP[i], i >= j, in the orbit of pr = vP[j] wrt auts.
2777 : * N.B.1 orbit need not be initialized to 0: useful to incrementally run
2778 : * through successive orbits
2779 : * N.B.2 i >= j, so primes with index < j will be missed; run incrementally
2780 : * starting from j = 1 ! */
2781 : static void
2782 11865 : pr_orbit_fill(GEN orbit, GEN auts, GEN vP, long j)
2783 : {
2784 11865 : GEN pr = gel(vP,j), gen = pr_get_gen(pr);
2785 11865 : long i, l = lg(auts), J = lg(orbit), f = pr_get_f(pr);
2786 11865 : orbit[j] = 1;
2787 23730 : for (i = 1; i < l; i++)
2788 : {
2789 11865 : GEN g = ZM_ZC_mul(gel(auts,i), gen);
2790 : long k;
2791 11886 : for (k = j+1; k < J; k++)
2792 : {
2793 35 : GEN prk = gel(vP,k);
2794 35 : if (pr_get_f(prk) > f) break; /* f(P[k]) increases with k */
2795 : /* don't check that e matches: (almost) always 1 ! */
2796 35 : if (!orbit[k] && ZC_prdvd(g, prk)) { orbit[k] = 1; break; }
2797 : }
2798 : }
2799 11865 : }
2800 : /* remark: F->KCZ changes if be_honest() fails */
2801 : static int
2802 7 : be_honest(FB_t *F, GEN nf, GEN auts, FACT *fact)
2803 : {
2804 : long i, iz, nbtest;
2805 7 : long lgsub = lg(F->subFB), KCZ0 = F->KCZ, N = nf_get_degree(nf);
2806 : FP_t fp;
2807 : pari_sp av;
2808 :
2809 7 : if (DEBUGLEVEL) {
2810 0 : err_printf("Be honest for %ld primes from %ld to %ld\n", F->KCZ2 - F->KCZ,
2811 0 : F->FB[ F->KCZ+1 ], F->FB[ F->KCZ2 ]);
2812 : }
2813 7 : minim_alloc(N+1, &fp.q, &fp.x, &fp.y, &fp.z, &fp.v);
2814 7 : if (lg(auts) == 1) auts = NULL;
2815 7 : av = avma;
2816 14 : for (iz=F->KCZ+1; iz<=F->KCZ2; iz++, set_avma(av))
2817 : {
2818 7 : long p = F->FB[iz];
2819 7 : GEN pr_orbit, P = gel(F->LV,p);
2820 7 : long j, J = lg(P); /* > 1 */
2821 : /* the P|p, NP > C2 are assumed in subgroup generated by FB + last P
2822 : * with NP <= C2 is unramified --> check all but last */
2823 7 : if (pr_get_e(gel(P,J-1)) == 1) J--;
2824 7 : if (J == 1) continue;
2825 7 : if (DEBUGLEVEL>1) err_printf("%ld ", p);
2826 7 : pr_orbit = auts? zero_zv(J-1): NULL;
2827 28 : for (j = 1; j < J; j++)
2828 : {
2829 : GEN Nid, id, id0;
2830 21 : if (pr_orbit)
2831 : {
2832 21 : if (pr_orbit[j]) continue;
2833 : /* discard all primes in automorphism orbit simultaneously */
2834 14 : pr_orbit_fill(pr_orbit, auts, P, j);
2835 : }
2836 14 : id = id0 = pr_hnf(nf,gel(P,j));
2837 14 : Nid = pr_norm(gel(P,j));
2838 14 : for (nbtest=0;;)
2839 : {
2840 14 : if (Fincke_Pohst_ideal(NULL, F, nf, id, Nid, fact, 0, &fp,
2841 14 : NULL, 0, 0, 0, NULL, NULL)) break;
2842 0 : if (++nbtest > maxtry_HONEST)
2843 : {
2844 0 : if (DEBUGLEVEL)
2845 0 : pari_warn(warner,"be_honest() failure on prime %Ps\n", gel(P,j));
2846 0 : return 0;
2847 : }
2848 : /* occurs at most once in the whole function */
2849 0 : for (i = 1, id = id0; i < lgsub; i++)
2850 : {
2851 0 : long ex = random_bits(RANDOM_BITS);
2852 0 : if (ex)
2853 : {
2854 0 : GEN pr = gel(F->LP, F->subFB[i]);
2855 0 : id = idealmulpowprime(nf, id, pr, utoipos(ex));
2856 : }
2857 : }
2858 0 : if (!equali1(gcoeff(id,N,N))) id = Q_primpart(id);
2859 0 : if (expi(gcoeff(id,1,1)) > 100) id = idealred(nf, id);
2860 0 : Nid = ZM_det_triangular(id);
2861 : }
2862 : }
2863 7 : F->KCZ++; /* SUCCESS, "enlarge" factorbase */
2864 : }
2865 7 : F->KCZ = KCZ0; return gc_bool(av,1);
2866 : }
2867 :
2868 : /* all primes with N(P) <= BOUND factor on factorbase ? */
2869 : void
2870 63 : bnftestprimes(GEN bnf, GEN BOUND)
2871 : {
2872 63 : pari_sp av0 = avma, av;
2873 63 : ulong count = 0;
2874 63 : GEN auts, p, nf = bnf_get_nf(bnf), Vbase = bnf_get_vbase(bnf);
2875 63 : GEN fb = gen_sort_shallow(Vbase, (void*)&cmp_prime_ideal, cmp_nodata);
2876 63 : ulong pmax = pr_get_smallp(veclast(fb)); /*largest p in factorbase*/
2877 : forprime_t S;
2878 : FACT *fact;
2879 : FB_t F;
2880 :
2881 63 : (void)recover_partFB(&F, Vbase, nf_get_degree(nf));
2882 63 : fact = (FACT*)stack_malloc((F.KC+1)*sizeof(FACT));
2883 63 : forprime_init(&S, gen_2, BOUND);
2884 63 : auts = automorphism_matrices(nf, NULL);
2885 63 : if (lg(auts) == 1) auts = NULL;
2886 63 : av = avma;
2887 37604 : while (( p = forprime_next(&S) ))
2888 : {
2889 : GEN pr_orbit, vP;
2890 : long j, J;
2891 :
2892 37541 : if (DEBUGLEVEL == 1 && ++count > 1000)
2893 : {
2894 0 : err_printf("passing p = %Ps / %Ps\n", p, BOUND);
2895 0 : count = 0;
2896 : }
2897 37541 : set_avma(av);
2898 37541 : vP = idealprimedec_limit_norm(nf, p, BOUND);
2899 37541 : J = lg(vP);
2900 : /* if last is unramified, all P|p in subgroup generated by FB: skip last */
2901 37541 : if (J > 1 && pr_get_e(gel(vP,J-1)) == 1) J--;
2902 37541 : if (J == 1) continue;
2903 14525 : if (DEBUGLEVEL>1) err_printf("*** p = %Ps\n",p);
2904 14525 : pr_orbit = auts? zero_zv(J-1): NULL;
2905 31549 : for (j = 1; j < J; j++)
2906 : {
2907 17024 : GEN P = gel(vP,j);
2908 17024 : long k = 0;
2909 17024 : if (pr_orbit)
2910 : {
2911 11858 : if (pr_orbit[j]) continue;
2912 : /* discard all primes in automorphism orbit simultaneously */
2913 11851 : pr_orbit_fill(pr_orbit, auts, vP, j);
2914 : }
2915 17017 : if (abscmpiu(p, pmax) > 0 || !(k = tablesearch(fb, P, &cmp_prime_ideal)))
2916 16408 : (void)SPLIT(&F, nf, pr_hnf(nf,P), Vbase, fact);
2917 17017 : if (DEBUGLEVEL>1)
2918 : {
2919 0 : err_printf(" Testing P = %Ps\n",P);
2920 0 : if (k) err_printf(" #%ld in factor base\n",k);
2921 0 : else err_printf(" is %Ps\n", isprincipal(bnf,P));
2922 : }
2923 : }
2924 : }
2925 63 : set_avma(av0);
2926 63 : }
2927 :
2928 : /* A t_MAT of complex floats, in fact reals. Extract a submatrix B
2929 : * whose columns are definitely nonzero, i.e. gexpo(A[j]) >= -2
2930 : *
2931 : * If possible precision problem (t_REAL 0 with large exponent), set
2932 : * *precpb to 1 */
2933 : static GEN
2934 93032 : clean_cols(GEN A, int *precpb)
2935 : {
2936 93032 : long l = lg(A), h, i, j, k;
2937 : GEN B;
2938 93032 : *precpb = 0;
2939 93032 : if (l == 1) return A;
2940 93032 : h = lgcols(A);;
2941 93032 : B = cgetg(l, t_MAT);
2942 1092714 : for (i = k = 1; i < l; i++)
2943 : {
2944 999682 : GEN Ai = gel(A,i);
2945 999682 : int non0 = 0;
2946 4357311 : for (j = 1; j < h; j++)
2947 : {
2948 3357630 : GEN c = gel(Ai,j);
2949 3357630 : if (gexpo(c) >= -2)
2950 : {
2951 2018596 : if (gequal0(c)) *precpb = 1; else non0 = 1;
2952 : }
2953 : }
2954 999681 : if (non0) gel(B, k++) = Ai;
2955 : }
2956 93032 : setlg(B, k); return B;
2957 : }
2958 :
2959 : static long
2960 576336 : compute_multiple_of_R_pivot(GEN X, GEN x0/*unused*/, long ix, GEN c)
2961 : {
2962 576336 : GEN x = gel(X,ix);
2963 576336 : long i, k = 0, ex = - (long)HIGHEXPOBIT, lx = lg(x);
2964 : (void)x0;
2965 2837800 : for (i=1; i<lx; i++)
2966 2261465 : if (!c[i] && !gequal0(gel(x,i)))
2967 : {
2968 729988 : long e = gexpo(gel(x,i));
2969 729987 : if (e > ex) { ex = e; k = i; }
2970 : }
2971 576335 : return (k && ex > -32)? k: lx;
2972 : }
2973 :
2974 : /* Ar = (log |sigma_i(u_j)|) for units (u_j) found so far;
2975 : * RU = R1+R2 = target rank for unit matrix, after adding [1 x r1, 2 x r2];
2976 : * N = field degree, need = unit rank defect;
2977 : * L = NULL (prec problem) or B^(-1) * A with approximate rational entries
2978 : * (as t_REAL), B a submatrix of A, with (probably) maximal rank RU */
2979 : static GEN
2980 121694 : compute_multiple_of_R(GEN Ar, long RU, long N, long *pneed, long *bit, GEN *ptL)
2981 : {
2982 : GEN T, d, mdet, Im_mdet, kR, L;
2983 121694 : long i, j, r, R1 = 2*RU - N;
2984 : int precpb;
2985 121694 : pari_sp av = avma;
2986 :
2987 121694 : if (RU == 1) { *ptL = zeromat(0, lg(Ar)-1); return gen_1; }
2988 :
2989 93032 : if (DEBUGLEVEL) err_printf("\n#### Computing regulator multiple\n");
2990 93032 : mdet = clean_cols(Ar, &precpb);
2991 : /* will cause precision to increase on later failure, but we may succeed! */
2992 93032 : *ptL = precpb? NULL: gen_1;
2993 93032 : T = cgetg(RU+1,t_COL);
2994 235137 : for (i=1; i<=R1; i++) gel(T,i) = gen_1;
2995 193248 : for ( ; i<=RU; i++) gel(T,i) = gen_2;
2996 93032 : mdet = shallowconcat(T, mdet); /* det(Span(mdet)) = N * R */
2997 :
2998 : /* could be using indexrank(), but need custom "get_pivot" function */
2999 93032 : d = RgM_pivots(mdet, &r, &compute_multiple_of_R_pivot, NULL);
3000 : /* # of independent columns = target rank ? */
3001 93032 : if (lg(mdet)-1 - r != RU)
3002 : {
3003 25381 : if (DEBUGLEVEL)
3004 0 : err_printf("Units matrix target rank = %ld < %ld\n",lg(mdet)-1 - r, RU);
3005 25381 : *pneed = RU - (lg(mdet)-1-r); return gc_NULL(av);
3006 : }
3007 :
3008 67651 : Im_mdet = cgetg(RU+1, t_MAT); /* extract independent columns */
3009 : /* N.B: d[1] = 1, corresponding to T above */
3010 67651 : gel(Im_mdet, 1) = T;
3011 257697 : for (i = j = 2; i <= RU; j++)
3012 190046 : if (d[j]) gel(Im_mdet, i++) = gel(mdet,j);
3013 :
3014 : /* integral multiple of R: the cols we picked form a Q-basis, they have an
3015 : * index in the full lattice. First column is T */
3016 67651 : kR = divru(det2(Im_mdet), N);
3017 : /* R > 0.2 uniformly */
3018 67651 : if (!signe(kR) || expo(kR) < -3)
3019 : {
3020 0 : if (DEBUGLEVEL) err_printf("Regulator is zero.\n");
3021 0 : *pneed = 0; return gc_NULL(av);
3022 : }
3023 67651 : d = det2(rowslice(vecslice(Im_mdet, 2, RU), 2, RU));
3024 67651 : setabssign(d); setabssign(kR);
3025 67651 : if (gexpo(gsub(d,kR)) - gexpo(d) > -20) { *ptL = NULL; return gc_NULL(av); }
3026 67649 : L = RgM_inv(Im_mdet);
3027 : /* estimate # of correct bits in result */
3028 67650 : if (!L || (*bit = -gexpo(RgM_Rg_sub_shallow(RgM_mul(L,Im_mdet), gen_1))) < 16)
3029 10 : { *ptL = NULL; return gc_NULL(av); }
3030 :
3031 67639 : *ptL = RgM_mul(rowslice(L,2,RU), Ar); /* approximate rational entries */
3032 67639 : return gc_all(av,2, &kR, ptL);
3033 : }
3034 :
3035 : /* leave small integer n as is, convert huge n to t_REAL (for readability) */
3036 : static GEN
3037 0 : i2print(GEN n)
3038 0 : { return lgefint(n) <= DEFAULTPREC? n: itor(n,LOWDEFAULTPREC); }
3039 :
3040 : static long
3041 96153 : bad_check(GEN c)
3042 : {
3043 96153 : long ec = gexpo(c);
3044 96153 : if (DEBUGLEVEL) err_printf("\n ***** check = %.28Pg\n",c);
3045 : /* safe check for c < 0.75 : avoid underflow in gtodouble() */
3046 96155 : if (ec < -1 || (ec == -1 && gtodouble(c) < 0.75)) return fupb_PRECI;
3047 : /* safe check for c > 1.3 : avoid overflow */
3048 96155 : if (ec > 0 || (ec == 0 && gtodouble(c) > 1.3)) return fupb_RELAT;
3049 64022 : return fupb_NONE;
3050 : }
3051 : /* Input:
3052 : * lambda = approximate rational entries: coords of units found so far on a
3053 : * sublattice of maximal rank (sublambda)
3054 : * *ptkR = regulator of sublambda = multiple of regulator of lambda
3055 : * Compute R = true regulator of lambda.
3056 : *
3057 : * If c := Rz ~ 1, by Dirichlet's formula, then lambda is the full group of
3058 : * units AND the full set of relations for the class group has been computed.
3059 : * In fact z is a very rough approximation and we only expect 0.75 < Rz < 1.3
3060 : *
3061 : * Output: *ptkR = R, *ptL = numerator(units) (in terms of lambda) */
3062 : static long
3063 96216 : compute_R(GEN lambda, GEN z, GEN *ptL, GEN *ptkR)
3064 : {
3065 96216 : pari_sp av = avma;
3066 96216 : long bit, r, reason, RU = lg(lambda) == 1? 1: lgcols(lambda);
3067 : GEN L, H, D, den, R, c;
3068 :
3069 96216 : *ptL = NULL;
3070 96216 : if (RU == 1) { *ptkR = gen_1; *ptL = lambda; return bad_check(z); }
3071 67554 : D = gmul2n(mpmul(*ptkR,z), 1); /* bound for denom(lambda) */
3072 67554 : if (expo(D) < 0 && rtodbl(D) < 0.95) return fupb_PRECI;
3073 67554 : L = bestappr(lambda,D);
3074 67555 : if (lg(L) == 1)
3075 : {
3076 0 : if (DEBUGLEVEL) err_printf("truncation error in bestappr\n");
3077 0 : return fupb_PRECI;
3078 : }
3079 67555 : den = Q_denom(L);
3080 67554 : if (mpcmp(den,D) > 0)
3081 : {
3082 15 : if (DEBUGLEVEL) err_printf("D = %Ps\nden = %Ps\n",D, i2print(den));
3083 15 : return fupb_PRECI;
3084 : }
3085 67538 : bit = -gexpo(gsub(L, lambda)); /* input accuracy */
3086 67540 : L = Q_muli_to_int(L, den);
3087 67539 : if (gexpo(L) + expi(den) > bit - 32)
3088 : {
3089 47 : if (DEBUGLEVEL) err_printf("dubious bestappr; den = %Ps\n", i2print(den));
3090 47 : return fupb_PRECI;
3091 : }
3092 67493 : H = ZM_hnf(L); r = lg(H)-1;
3093 67493 : if (!r || r != nbrows(H))
3094 0 : R = gen_0; /* wrong rank */
3095 : else
3096 67493 : R = gmul(*ptkR, gdiv(ZM_det_triangular(H), powiu(den, r)));
3097 : /* R = tentative regulator; regulator > 0.2 uniformly */
3098 67492 : if (gexpo(R) < -3) {
3099 0 : if (DEBUGLEVEL) err_printf("\n#### Tentative regulator: %.28Pg\n", R);
3100 0 : return gc_long(av, fupb_PRECI);
3101 : }
3102 67492 : c = gmul(R,z); /* should be n (= 1 if we are done) */
3103 67491 : if (DEBUGLEVEL) err_printf("\n#### Tentative regulator: %.28Pg\n", R);
3104 67491 : if ((reason = bad_check(c))) return gc_long(av, reason);
3105 48804 : *ptkR = R; *ptL = L; return fupb_NONE;
3106 : }
3107 : static GEN
3108 64112 : get_clg2(GEN cyc, GEN Ga, GEN C, GEN Ur, GEN Ge, GEN M1, GEN M2)
3109 : {
3110 64112 : GEN GD = gsub(act_arch(M1, C), diagact_arch(cyc, Ga));
3111 64112 : GEN ga = gsub(act_arch(M2, C), act_arch(Ur, Ga));
3112 64111 : return mkvecn(6, Ur, ga, GD, Ge, M1, M2);
3113 : }
3114 : /* compute class group (clg1) + data for isprincipal (clg2) */
3115 : static GEN
3116 64014 : class_group_gen(GEN nf,GEN W,GEN C,GEN Vbase,long prec, GEN *pclg2)
3117 : {
3118 : GEN M1, M2, z, G, Ga, Ge, cyc, X, Y, D, U, V, Ur, Ui, Uir;
3119 : long j, l;
3120 :
3121 64014 : D = ZM_snfall(W,&U,&V); /* UWV=D, D diagonal, G = g Ui (G=new gens, g=old) */
3122 64015 : Ui = ZM_inv(U, NULL);
3123 64015 : l = lg(D); cyc = cgetg(l, t_VEC); /* elementary divisors */
3124 92792 : for (j = 1; j < l; j++)
3125 : {
3126 30363 : gel(cyc,j) = gcoeff(D,j,j); /* strip useless components */
3127 30363 : if (is_pm1(gel(cyc,j))) break;
3128 : }
3129 64015 : l = j;
3130 64015 : Ur = ZM_hnfdivrem(U, D, &Y);
3131 64015 : Uir = ZM_hnfdivrem(Ui,W, &X);
3132 : /* {x} = logarithmic embedding of x (arch. component)
3133 : * NB: [J,z] = idealred(I) --> I = y J, with {y} = - z
3134 : * G = g Uir - {Ga}, Uir = Ui - WX
3135 : * g = G Ur - {ga}, Ur = U - DY */
3136 64015 : G = cgetg(l,t_VEC);
3137 64015 : Ga= cgetg(l,t_MAT);
3138 64015 : Ge= cgetg(l,t_COL);
3139 64015 : z = init_famat(NULL);
3140 92791 : for (j = 1; j < l; j++)
3141 : {
3142 28776 : GEN I = genback(z, nf, Vbase, gel(Uir,j));
3143 28777 : gel(G,j) = gel(I,1); /* generator, order cyc[j] */
3144 28777 : gel(Ge,j)= gel(I,2);
3145 28777 : gel(Ga,j)= nf_cxlog(nf, gel(I,2), prec);
3146 28777 : if (!gel(Ga,j)) pari_err_PREC("class_group_gen");
3147 : }
3148 : /* {ga} = - {GD}Y + G U - g = - {GD}Y - {Ga} U - gW X U
3149 : = - gW (X Ur + V Y) - {Ga}Ur */
3150 64015 : M2 = ZM_neg(ZM_add(ZM_mul(X,Ur), ZM_mul(V,Y)));
3151 64015 : setlg(cyc,l); setlg(V,l); setlg(D,l);
3152 : /* G D =: {GD} = g (Ui - W X) D - {Ga}D = g W (V - X D) - {Ga}D
3153 : * NB: Ui D = W V. gW is given by (first l-1 cols of) C */
3154 64015 : M1 = ZM_sub(V, ZM_mul(X,D));
3155 64015 : *pclg2 = get_clg2(cyc, Ga, C, Ur, Ge, M1, M2);
3156 64014 : return mkvec3(ZV_prod(cyc), cyc, G);
3157 : }
3158 :
3159 : /* compute principal ideals corresponding to (gen[i]^cyc[i]) */
3160 : static GEN
3161 4956 : makecycgen(GEN bnf)
3162 : {
3163 4956 : GEN cyc = bnf_get_cyc(bnf), gen = bnf_get_gen(bnf), nf = bnf_get_nf(bnf);
3164 4956 : GEN h, y, GD = bnf_get_GD(bnf), W = bnf_get_W(bnf); /* HNF */
3165 4956 : GEN SUnits = bnf_get_sunits(bnf);
3166 4956 : GEN X = SUnits? gel(SUnits,1): NULL, C = SUnits? gel(SUnits,3): NULL;
3167 : long e, i, l;
3168 :
3169 4956 : if (DEBUGLEVEL) pari_warn(warner,"completing bnf (building cycgen)");
3170 4956 : h = cgetg_copy(gen, &l);
3171 11613 : for (i = 1; i < l; i++)
3172 : {
3173 6657 : GEN gi = gel(gen,i), ci = gel(cyc,i);
3174 6657 : if (X && equalii(ci, gcoeff(W,i,i)))
3175 : {
3176 : long j;
3177 8589 : for (j = i+1; j < l; j++)
3178 3213 : if (signe(gcoeff(W,i,j))) break;
3179 5550 : if (j == i) { gel(h,i) = mkmat2(X, gel(C,i)); continue; }
3180 : }
3181 6657 : if (abscmpiu(ci, 5) < 0)
3182 : {
3183 5544 : GEN N = ZM_det_triangular(gi);
3184 5544 : y = isprincipalarch(bnf,gel(GD,i), N, ci, gen_1, &e);
3185 5544 : if (y && fact_ok(nf,y,NULL,mkvec(gi),mkvec(ci)))
3186 : {
3187 4556 : gel(h,i) = to_famat_shallow(y,gen_1);
3188 4556 : continue;
3189 : }
3190 : }
3191 2101 : y = isprincipalfact(bnf, NULL, mkvec(gi), mkvec(ci), nf_GENMAT|nf_FORCE);
3192 2101 : gel(h,i) = gel(y,2);
3193 : }
3194 4956 : return h;
3195 : }
3196 :
3197 : static GEN
3198 69 : get_y(GEN bnf, GEN W, GEN B, GEN C, GEN pFB, long j)
3199 : {
3200 69 : GEN y, nf = bnf_get_nf(bnf);
3201 69 : long e, lW = lg(W)-1;
3202 69 : GEN ex = (j<=lW)? gel(W,j): gel(B,j-lW);
3203 69 : GEN P = (j<=lW)? NULL: gel(pFB,j);
3204 69 : if (C)
3205 : { /* archimedean embeddings known: cheap trial */
3206 69 : GEN Nx = get_norm_fact_primes(pFB, ex, P);
3207 69 : y = isprincipalarch(bnf,gel(C,j), Nx,gen_1, gen_1, &e);
3208 69 : if (y && fact_ok(nf,y,P,pFB,ex)) return y;
3209 : }
3210 0 : y = isprincipalfact_or_fail(bnf, P, pFB, ex);
3211 0 : return typ(y) == t_INT? y: gel(y,2);
3212 : }
3213 : /* compute principal ideals corresponding to bnf relations */
3214 : static GEN
3215 20 : makematal(GEN bnf)
3216 : {
3217 20 : GEN W = bnf_get_W(bnf), B = bnf_get_B(bnf), C = bnf_get_C(bnf);
3218 : GEN pFB, ma, retry;
3219 20 : long lma, j, prec = 0;
3220 :
3221 20 : if (DEBUGLEVEL) pari_warn(warner,"completing bnf (building matal)");
3222 20 : lma=lg(W)+lg(B)-1;
3223 20 : pFB = bnf_get_vbase(bnf);
3224 20 : ma = cgetg(lma,t_VEC);
3225 20 : retry = vecsmalltrunc_init(lma);
3226 89 : for (j=lma-1; j>0; j--)
3227 : {
3228 69 : pari_sp av = avma;
3229 69 : GEN y = get_y(bnf, W, B, C, pFB, j);
3230 69 : if (typ(y) == t_INT)
3231 : {
3232 0 : long E = itos(y);
3233 0 : if (DEBUGLEVEL>1) err_printf("\n%ld done later at prec %ld\n",j,E);
3234 0 : set_avma(av);
3235 0 : vecsmalltrunc_append(retry, j);
3236 0 : if (E > prec) prec = E;
3237 : }
3238 : else
3239 : {
3240 69 : if (DEBUGLEVEL>1) err_printf("%ld ",j);
3241 69 : gel(ma,j) = gc_upto(av,y);
3242 : }
3243 : }
3244 20 : if (prec)
3245 : {
3246 0 : long k, l = lg(retry);
3247 0 : GEN y, nf = bnf_get_nf(bnf);
3248 0 : if (DEBUGLEVEL) pari_warn(warnprec,"makematal",prec);
3249 0 : nf = nfnewprec_shallow(nf,prec);
3250 0 : bnf = Buchall(nf, nf_FORCE, prec);
3251 0 : if (DEBUGLEVEL) err_printf("makematal, adding missing entries:");
3252 0 : for (k=1; k<l; k++)
3253 : {
3254 0 : pari_sp av = avma;
3255 0 : long j = retry[k];
3256 0 : y = get_y(bnf,W,B,NULL, pFB, j);
3257 0 : if (typ(y) == t_INT) pari_err_PREC("makematal");
3258 0 : if (DEBUGLEVEL>1) err_printf("%ld ",j);
3259 0 : gel(ma,j) = gc_upto(av,y);
3260 : }
3261 : }
3262 20 : if (DEBUGLEVEL>1) err_printf("\n");
3263 20 : return ma;
3264 : }
3265 :
3266 : enum { MATAL = 1, CYCGEN, UNITS };
3267 : GEN
3268 26726 : bnf_build_cycgen(GEN bnf)
3269 26726 : { return obj_checkbuild(bnf, CYCGEN, &makecycgen); }
3270 : GEN
3271 20 : bnf_build_matalpha(GEN bnf)
3272 20 : { return obj_checkbuild(bnf, MATAL, &makematal); }
3273 : GEN
3274 50731 : bnf_build_units(GEN bnf)
3275 50731 : { return obj_checkbuild(bnf, UNITS, &makeunits); }
3276 :
3277 : /* return fu in compact form if available; in terms of a fixed basis
3278 : * of S-units */
3279 : GEN
3280 70 : bnf_compactfu_mat(GEN bnf)
3281 : {
3282 70 : GEN X, U, SUnits = bnf_get_sunits(bnf);
3283 70 : if (!SUnits) return NULL;
3284 70 : X = gel(SUnits,1);
3285 70 : U = gel(SUnits,2); ZM_remove_unused(&U, &X);
3286 70 : return mkvec2(X, U);
3287 : }
3288 : /* return fu in compact form if available; individually as famat */
3289 : GEN
3290 37415 : bnf_compactfu(GEN bnf)
3291 : {
3292 37415 : GEN fu, X, U, SUnits = bnf_get_sunits(bnf);
3293 : long i, l;
3294 37415 : if (!SUnits) return NULL;
3295 37184 : X = gel(SUnits,1);
3296 37184 : U = gel(SUnits,2); l = lg(U); fu = cgetg(l, t_VEC);
3297 61215 : for (i = 1; i < l; i++)
3298 24031 : gel(fu,i) = famat_remove_trivial(mkmat2(X, gel(U,i)));
3299 37184 : return fu;
3300 : }
3301 : /* return expanded fu if available */
3302 : GEN
3303 285756 : bnf_has_fu(GEN bnf)
3304 : {
3305 285756 : GEN fu = obj_check(bnf, UNITS);
3306 285757 : if (fu) return vecsplice(fu, 1);
3307 264109 : fu = bnf_get_fu_nocheck(bnf);
3308 264109 : return (typ(fu) == t_MAT)? NULL: fu;
3309 : }
3310 : /* return expanded fu if available; build if cheap */
3311 : GEN
3312 285477 : bnf_build_cheapfu(GEN bnf)
3313 : {
3314 : GEN fu, SUnits;
3315 285477 : if ((fu = bnf_has_fu(bnf))) return fu;
3316 142 : if ((SUnits = bnf_get_sunits(bnf)))
3317 : {
3318 142 : pari_sp av = avma;
3319 142 : long e = gexpo(real_i(bnf_get_logfu(bnf)));
3320 142 : set_avma(av); if (e < 13) return vecsplice(bnf_build_units(bnf), 1);
3321 : }
3322 77 : return NULL;
3323 : }
3324 :
3325 : static GEN
3326 48893 : get_regulator(GEN A)
3327 : {
3328 48893 : pari_sp av = avma;
3329 : GEN R;
3330 :
3331 48893 : if (lg(A) == 1) return gen_1;
3332 48886 : R = det( rowslice(real_i(A), 1, lgcols(A)-2) );
3333 48885 : setabssign(R); return gc_leaf(av, R);
3334 : }
3335 :
3336 : /* return corrected archimedian components for elts of x (vector)
3337 : * (= log(sigma_i(x)) - log(|Nx|) / [K:Q]) */
3338 : static GEN
3339 40 : get_archclean(GEN nf, GEN x, long prec, int units)
3340 : {
3341 40 : long k, N, l = lg(x);
3342 40 : GEN M = cgetg(l, t_MAT);
3343 :
3344 40 : if (l == 1) return M;
3345 26 : N = nf_get_degree(nf);
3346 114 : for (k = 1; k < l; k++)
3347 : {
3348 88 : pari_sp av = avma;
3349 88 : GEN c = nf_cxlog(nf, gel(x,k), prec);
3350 88 : if (!c || (!units && !(c = cleanarch(c, N, NULL,prec)))) return NULL;
3351 88 : gel(M,k) = gc_GEN(av, c);
3352 : }
3353 26 : return M;
3354 : }
3355 : static void
3356 77 : SUnits_archclean(GEN nf, GEN SUnits, GEN *pmun, GEN *pC, long prec)
3357 : {
3358 77 : GEN ipi, M, X = gel(SUnits,1), U = gel(SUnits,2), G = gel(SUnits,3);
3359 77 : long k, N = nf_get_degree(nf), l = lg(X);
3360 :
3361 77 : M = cgetg(l, t_MAT);
3362 3640 : for (k = 1; k < l; k++)
3363 3563 : if (!(gel(M,k) = nf_cxlog(nf, gel(X,k), prec))) return;
3364 77 : ipi = invr(mppi(prec));
3365 77 : *pmun = cleanarch(RgM_ZM_mul(M, U), N, ipi, prec); /* not cleanarchunit ! */
3366 77 : if (*pmun) *pC = cleanarch(RgM_ZM_mul(M, G), N, ipi, prec);
3367 : }
3368 :
3369 : GEN
3370 97 : bnfnewprec_shallow(GEN bnf, long prec)
3371 : {
3372 97 : GEN nf0 = bnf_get_nf(bnf), nf, v, fu, matal, y, A, C;
3373 97 : GEN SUnits = bnf_get_sunits(bnf), Ur, Ga, Ge, M1, M2;
3374 97 : long r1, r2, prec0 = prec;
3375 :
3376 97 : nf_get_sign(nf0, &r1, &r2);
3377 97 : if (SUnits)
3378 : {
3379 77 : fu = matal = NULL;
3380 77 : prec += nbits2extraprec(gexpo(SUnits));
3381 : }
3382 : else
3383 : {
3384 20 : fu = bnf_build_units(bnf);
3385 20 : fu = vecslice(fu, 2, lg(fu)-1);
3386 20 : if (r1 + r2 > 1) {
3387 13 : long e = gexpo(bnf_get_logfu(bnf)) + 1 - TWOPOTBITS_IN_LONG;
3388 13 : if (e >= 0) prec += nbits2extraprec(e);
3389 : }
3390 20 : matal = bnf_build_matalpha(bnf);
3391 : }
3392 :
3393 97 : if (DEBUGLEVEL && prec0 != prec) pari_warn(warnprec,"bnfnewprec",prec);
3394 97 : for(C = NULL;;)
3395 0 : {
3396 97 : pari_sp av = avma;
3397 97 : nf = nfnewprec_shallow(nf0,prec);
3398 97 : if (SUnits)
3399 77 : SUnits_archclean(nf, SUnits, &A, &C, prec);
3400 : else
3401 : {
3402 20 : A = get_archclean(nf, fu, prec, 1);
3403 20 : if (A) C = get_archclean(nf, matal, prec, 0);
3404 : }
3405 97 : if (C) break;
3406 0 : set_avma(av); prec = precdbl(prec);
3407 0 : if (DEBUGLEVEL) pari_warn(warnprec,"bnfnewprec(extra)",prec);
3408 : }
3409 97 : y = leafcopy(bnf);
3410 97 : gel(y,3) = A;
3411 97 : gel(y,4) = C;
3412 97 : gel(y,7) = nf;
3413 97 : gel(y,8) = v = leafcopy(gel(bnf,8));
3414 97 : gel(v,2) = get_regulator(A);
3415 97 : v = gel(bnf,9);
3416 97 : if (lg(v) < 7) pari_err_TYPE("bnfnewprec [obsolete bnf format]", bnf);
3417 97 : Ur = gel(v,1);
3418 97 : Ge = gel(v,4);
3419 97 : Ga = nfV_cxlog(nf, Ge, prec);
3420 97 : M1 = gel(v,5);
3421 97 : M2 = gel(v,6);
3422 97 : gel(y,9) = get_clg2(bnf_get_cyc(bnf), Ga, C, Ur, Ge, M1, M2);
3423 97 : return y;
3424 : }
3425 : GEN
3426 7 : bnfnewprec(GEN bnf, long prec)
3427 : {
3428 7 : pari_sp av = avma;
3429 7 : return gc_GEN(av, bnfnewprec_shallow(checkbnf(bnf), prec));
3430 : }
3431 :
3432 : GEN
3433 0 : bnrnewprec_shallow(GEN bnr, long prec)
3434 : {
3435 0 : GEN y = cgetg(7,t_VEC);
3436 : long i;
3437 0 : gel(y,1) = bnfnewprec_shallow(bnr_get_bnf(bnr), prec);
3438 0 : for (i=2; i<7; i++) gel(y,i) = gel(bnr,i);
3439 0 : return y;
3440 : }
3441 : GEN
3442 7 : bnrnewprec(GEN bnr, long prec)
3443 : {
3444 7 : GEN y = cgetg(7,t_VEC);
3445 : long i;
3446 7 : checkbnr(bnr);
3447 7 : gel(y,1) = bnfnewprec(bnr_get_bnf(bnr), prec);
3448 42 : for (i=2; i<7; i++) gel(y,i) = gcopy(gel(bnr,i));
3449 7 : return y;
3450 : }
3451 :
3452 : static GEN
3453 65218 : buchall_end(GEN nf,GEN res, GEN clg2, GEN W, GEN B, GEN A, GEN C,GEN Vbase)
3454 : {
3455 65218 : GEN z = obj_init(9, 3);
3456 65218 : gel(z,1) = W;
3457 65218 : gel(z,2) = B;
3458 65218 : gel(z,3) = A;
3459 65218 : gel(z,4) = C;
3460 65218 : gel(z,5) = Vbase;
3461 65218 : gel(z,6) = gen_0;
3462 65218 : gel(z,7) = nf;
3463 65218 : gel(z,8) = res;
3464 65218 : gel(z,9) = clg2;
3465 65218 : return z;
3466 : }
3467 :
3468 : GEN
3469 2625 : bnfinit0(GEN P, long flag, GEN data, long prec)
3470 : {
3471 2625 : double c1 = 0., c2 = 0.;
3472 2625 : long fl, relpid = BNF_RELPID;
3473 :
3474 2625 : if (data)
3475 : {
3476 21 : long lx = lg(data);
3477 21 : if (typ(data) != t_VEC || lx > 5) pari_err_TYPE("bnfinit",data);
3478 21 : switch(lx)
3479 : {
3480 0 : case 4: relpid = itos(gel(data,3));
3481 14 : case 3: c2 = gtodouble(gel(data,2));
3482 21 : case 2: c1 = gtodouble(gel(data,1));
3483 : }
3484 : }
3485 2625 : switch(flag)
3486 : {
3487 1771 : case 2:
3488 1771 : case 0: fl = 0; break;
3489 854 : case 1: fl = nf_FORCE; break;
3490 0 : default: pari_err_FLAG("bnfinit");
3491 : return NULL; /* LCOV_EXCL_LINE */
3492 : }
3493 2625 : return Buchall_param(P, c1, c2, relpid, fl, prec);
3494 : }
3495 : GEN
3496 62599 : Buchall(GEN P, long flag, long prec)
3497 62599 : { return Buchall_param(P, 0., 0., BNF_RELPID, flag & nf_FORCE, prec); }
3498 :
3499 : static GEN
3500 1204 : Buchall_deg1(GEN nf)
3501 : {
3502 1204 : GEN v = cgetg(1,t_VEC), m = cgetg(1,t_MAT);
3503 1204 : GEN res, W, A, B, C, Vbase = cgetg(1,t_COL);
3504 1204 : GEN fu = v, R = gen_1, zu = mkvec2(gen_2, gen_m1);
3505 1204 : GEN clg1 = mkvec3(gen_1,v,v), clg2 = mkvecn(6, m,m,m,v,m,m);
3506 :
3507 1204 : W = A = B = C = m; res = mkvec5(clg1, R, gen_1, zu, fu);
3508 1204 : return buchall_end(nf,res,clg2,W,B,A,C,Vbase);
3509 : }
3510 :
3511 : /* return (small set of) indices of columns generating the same lattice as x.
3512 : * Assume HNF(x) is inexpensive (few rows, many columns).
3513 : * Dichotomy approach since interesting columns may be at the very end */
3514 : GEN
3515 64022 : extract_full_lattice(GEN x)
3516 : {
3517 64022 : long dj, j, k, l = lg(x);
3518 : GEN h, h2, H, v;
3519 :
3520 64022 : if (l < 200) return NULL; /* not worth it */
3521 :
3522 1 : v = vecsmalltrunc_init(l);
3523 1 : H = ZM_hnf(x);
3524 1 : h = cgetg(1, t_MAT);
3525 1 : dj = 1;
3526 43 : for (j = 1; j < l; )
3527 : {
3528 43 : pari_sp av = avma;
3529 43 : long lv = lg(v);
3530 :
3531 145 : for (k = 0; k < dj; k++) v[lv+k] = j+k;
3532 43 : setlg(v, lv + dj);
3533 43 : h2 = ZM_hnf(vecpermute(x, v));
3534 43 : if (ZM_equal(h, h2))
3535 : { /* these dj columns can be eliminated */
3536 17 : set_avma(av); setlg(v, lv);
3537 17 : j += dj;
3538 17 : if (j >= l) break;
3539 17 : dj <<= 1;
3540 17 : if (j + dj >= l) { dj = (l - j) >> 1; if (!dj) dj = 1; }
3541 : }
3542 26 : else if (dj > 1)
3543 : { /* at least one interesting column, try with first half of this set */
3544 17 : set_avma(av); setlg(v, lv);
3545 17 : dj >>= 1; /* > 0 */
3546 : }
3547 : else
3548 : { /* this column should be kept */
3549 9 : if (ZM_equal(h2, H)) break;
3550 8 : h = h2; j++;
3551 : }
3552 : }
3553 1 : return v;
3554 : }
3555 :
3556 : static void
3557 64093 : init_rel(RELCACHE_t *cache, FB_t *F, long add_need)
3558 : {
3559 64093 : const long n = F->KC + add_need; /* expected # of needed relations */
3560 : long i, j, k, p;
3561 : GEN c, P;
3562 : GEN R;
3563 :
3564 64093 : if (DEBUGLEVEL) err_printf("KCZ = %ld, KC = %ld, n = %ld\n", F->KCZ,F->KC,n);
3565 64093 : reallocate(cache, 10*n + 50); /* make room for lots of relations */
3566 64093 : cache->chk = cache->base;
3567 64093 : cache->end = cache->base + n;
3568 64093 : cache->relsup = add_need;
3569 64093 : cache->last = cache->base;
3570 64093 : cache->missing = lg(cache->basis) - 1;
3571 306062 : for (i = 1; i <= F->KCZ; i++)
3572 : { /* trivial relations (p) = prod P^e */
3573 241969 : p = F->FB[i]; P = gel(F->LV,p);
3574 241969 : if (!isclone(P)) continue;
3575 :
3576 : /* all prime divisors in FB */
3577 168784 : c = zero_Flv(F->KC); k = F->iLP[p];
3578 168783 : R = c; c += k;
3579 538751 : for (j = lg(P)-1; j; j--) c[j] = pr_get_e(gel(P,j));
3580 168783 : add_rel(cache, F, R, k+1, pr_get_p(gel(P,1)), 0);
3581 : }
3582 64093 : }
3583 :
3584 : /* Let z = \zeta_n in nf. List of not-obviously-dependent generators for
3585 : * cyclotomic units modulo torsion in Q(z) [independent when n a prime power]:
3586 : * - z^a - 1, n/(a,n) not a prime power, a \nmid n unless a=1, 1 <= a < n/2
3587 : * - (Z^a - 1)/(Z - 1), p^k || n, Z = z^{n/p^k}, (p,a) = 1, 1 < a <= (p^k-1)/2
3588 : */
3589 : GEN
3590 64093 : nfcyclotomicunits(GEN nf, GEN zu)
3591 : {
3592 64093 : long n = itos(gel(zu, 1)), n2, lP, i, a;
3593 : GEN z, fa, P, E, L, mz, powz;
3594 64093 : if (n <= 6) return cgetg(1, t_VEC);
3595 :
3596 1911 : z = algtobasis(nf,gel(zu, 2));
3597 1911 : if ((n & 3) == 2) { n = n >> 1; z = ZC_neg(z); } /* ensure n != 2 (mod 4) */
3598 1911 : n2 = n/2;
3599 1911 : mz = zk_multable(nf, z); /* multiplication by z */
3600 1911 : powz = cgetg(n2, t_VEC); gel(powz,1) = z;
3601 6286 : for (i = 2; i < n2; i++) gel(powz,i) = ZM_ZC_mul(mz, gel(powz,i-1));
3602 : /* powz[i] = z^i */
3603 :
3604 1911 : L = vectrunc_init(n);
3605 1911 : fa = factoru(n);
3606 1911 : P = gel(fa,1); lP = lg(P);
3607 1911 : E = gel(fa,2);
3608 4613 : for (i = 1; i < lP; i++)
3609 : { /* second kind */
3610 2702 : long p = P[i], k = E[i], pk = upowuu(p,k), pk2 = (pk-1) / 2;
3611 2702 : GEN u = gen_1;
3612 4970 : for (a = 2; a <= pk2; a++)
3613 : {
3614 2268 : u = nfadd(nf, u, gel(powz, (n/pk) * (a-1))); /* = (Z^a-1)/(Z-1) */
3615 2268 : if (a % p) vectrunc_append(L, u);
3616 : }
3617 : }
3618 6160 : if (lP > 2) for (a = 1; a < n2; a++)
3619 : { /* first kind, when n not a prime power */
3620 : ulong p;
3621 4249 : if (a > 1 && (n % a == 0 || uisprimepower(n/ugcd(a,n), &p))) continue;
3622 1869 : vectrunc_append(L, nfadd(nf, gel(powz, a), gen_m1));
3623 : }
3624 1911 : return L;
3625 : }
3626 : static void
3627 64093 : add_cyclotomic_units(GEN nf, GEN zu, RELCACHE_t *cache, FB_t *F)
3628 : {
3629 64093 : pari_sp av = avma;
3630 64093 : GEN L = nfcyclotomicunits(nf, zu);
3631 64093 : long i, l = lg(L);
3632 64093 : if (l > 1)
3633 : {
3634 1911 : GEN R = zero_Flv(F->KC);
3635 5950 : for(i = 1; i < l; i++) add_rel(cache, F, R, F->KC+1, gel(L,i), 0);
3636 : }
3637 64093 : set_avma(av);
3638 64093 : }
3639 :
3640 : static GEN
3641 122420 : trim_list(FB_t *F)
3642 : {
3643 122420 : pari_sp av = avma;
3644 122420 : GEN v, L_jid = F->L_jid, minidx = F->minidx, present = zero_Flv(F->KC);
3645 122418 : long i, j, imax = minss(lg(L_jid), F->KC + 1);
3646 :
3647 122418 : v = cgetg(imax, t_VECSMALL);
3648 1324647 : for (i = j = 1; i < imax; i++)
3649 : {
3650 1202229 : long k = minidx[ L_jid[i] ];
3651 1202229 : if (!present[k]) { v[j++] = L_jid[i]; present[k] = 1; }
3652 : }
3653 122418 : setlg(v, j); return gc_leaf(av, v);
3654 : }
3655 :
3656 : /* x t_INT or primitive ZC */
3657 : static void
3658 1738 : try_elt(RELCACHE_t *cache, FB_t *F, GEN nf, GEN x, FACT *fact)
3659 : {
3660 1738 : pari_sp av = avma;
3661 : long nz;
3662 : GEN R;
3663 :
3664 1738 : if (typ(x) == t_INT /* 2nd path can't fail */
3665 1738 : || !can_factor(F, nf, NULL, x, nfnorm(nf, x), fact)) return;
3666 : /* smooth element */
3667 1506 : R = set_fact(F, fact, NULL, &nz);
3668 : /* make sure we get maximal rank first, then allow all relations */
3669 1506 : (void)add_rel(cache, F, R, nz, x, 0);
3670 1506 : set_avma(av);
3671 : }
3672 :
3673 : static void
3674 55452 : matenlarge(GEN C, long h)
3675 : {
3676 55452 : GEN _0 = zerocol(h);
3677 : long i;
3678 1257500 : for (i = lg(C); --i; ) gel(C,i) = shallowconcat(gel(C,i), _0);
3679 55451 : }
3680 :
3681 : /* E = floating point embeddings */
3682 : static GEN
3683 55452 : matbotidembs(RELCACHE_t *cache, GEN E)
3684 : {
3685 55452 : long w = cache->last - cache->chk, h = cache->last - cache->base;
3686 55452 : long j, d = h - w, hE = nbrows(E);
3687 55452 : GEN y = cgetg(w+1,t_MAT), _0 = zerocol(h);
3688 217014 : for (j = 1; j <= w; j++)
3689 : {
3690 161562 : GEN c = shallowconcat(gel(E,j), _0);
3691 161562 : if (d + j >= 1) gel(c, d + j + hE) = gen_1;
3692 161562 : gel(y,j) = c;
3693 : }
3694 55452 : return y;
3695 : }
3696 : static GEN
3697 62497 : matbotid(RELCACHE_t *cache)
3698 : {
3699 62497 : long w = cache->last - cache->chk, h = cache->last - cache->base;
3700 62497 : long j, d = h - w;
3701 62497 : GEN y = cgetg(w+1,t_MAT);
3702 851228 : for (j = 1; j <= w; j++)
3703 : {
3704 788732 : GEN c = zerocol(h);
3705 788731 : if (d + j >= 1) gel(c, d + j) = gen_1;
3706 788731 : gel(y,j) = c;
3707 : }
3708 62496 : return y;
3709 : }
3710 :
3711 : static long
3712 73 : myprecdbl(long prec, GEN C)
3713 : {
3714 73 : long p = prec < 1280? precdbl(prec): (long)(prec * 1.5);
3715 73 : if (C) p = maxss(p, minss(3*p, prec + nbits2extraprec(gexpo(C))));
3716 73 : return p;
3717 : }
3718 :
3719 : static GEN
3720 57729 : _nfnewprec(GEN nf, long prec, long *isclone)
3721 : {
3722 57729 : GEN NF = gclone(nfnewprec_shallow(nf, prec));
3723 57729 : if (*isclone) gunclone(nf);
3724 57729 : *isclone = 1; return NF;
3725 : }
3726 :
3727 : /* In small_norm, LLL reduction produces v0 in I such that
3728 : * T2(v0) <= (4/3)^((n-1)/2) (NI sqrt(disc(K)))^(2/n)
3729 : * NI <= LIMCMAX^2. We consider v with T2(v) ~ T2(v0), hence
3730 : * Nv <= ((4/3)^((n-1)/2) / n)^(n/2) LIMCMAX^2 sqrt(disc(K)) */
3731 : static long
3732 64012 : small_norm_prec(long N, double LOGD, long LIMCMAX)
3733 : {
3734 64012 : double a = N/2. * ((N-1)/2.*log(4./3) - log((double)N));
3735 64012 : double b = 2*log((double)LIMCMAX) + LOGD/2;
3736 64012 : return nbits2prec(BITS_IN_LONG + (a + b) / M_LN2);
3737 : }
3738 :
3739 : /* Nrelid = nb relations per ideal, possibly 0. If flag is set, keep data in
3740 : * algebraic form. */
3741 : GEN
3742 65224 : Buchall_param(GEN P, double cbach, double cbach2, long Nrelid, long flag, long prec)
3743 : {
3744 : pari_timer T;
3745 65224 : pari_sp av0 = avma, av, av2;
3746 : long PREC, N, R1, R2, RU, low, high, LIMC0, LIMC, LIMC2, LIMCMAX, zc, i;
3747 65224 : long LIMres, bit = 0, flag_nfinit = 0, nfisclone = 0;
3748 65224 : long nreldep, sfb_trials, need, old_need, precdouble = 0, TRIES = 0;
3749 : long done_small, small_fail, fail_limit, squash_index;
3750 : double LOGD, LOGD2, lim;
3751 65224 : GEN computed = NULL, fu = NULL, zu, nf, D, A, W, R, h, Ce, PERM;
3752 : GEN small_multiplier, auts, cyclic, embs, SUnits;
3753 : GEN res, L, invhr, B, C, lambda, dep, clg1, clg2, Vbase;
3754 65224 : const char *precpb = NULL;
3755 65224 : REL_t *old_cache = NULL;
3756 : nfmaxord_t nfT;
3757 : RELCACHE_t cache;
3758 : FB_t F;
3759 : GRHcheck_t GRHcheck;
3760 : FACT *fact;
3761 :
3762 65224 : if (DEBUGLEVEL) timer_start(&T);
3763 65224 : P = get_nfpol(P, &nf);
3764 65211 : if (degpol(P)==2) Nrelid = 0;
3765 65210 : if (nf)
3766 3885 : D = nf_get_disc(nf);
3767 : else
3768 : {
3769 61325 : nfinit_basic(&nfT, P);
3770 61331 : D = nfT.dK;
3771 61331 : if (!ZX_is_monic(nfT.T0))
3772 : {
3773 14 : pari_warn(warner,"nonmonic polynomial in bnfinit, using polredbest");
3774 14 : flag_nfinit = nf_RED;
3775 : }
3776 : }
3777 65216 : PREC = maxss(DEFAULTPREC, prec);
3778 65216 : N = degpol(P);
3779 65216 : if (N <= 1)
3780 : {
3781 1204 : if (!nf) nf = nfinit_complete(&nfT, flag_nfinit, PREC);
3782 1204 : return gc_GEN(av0, Buchall_deg1(nf));
3783 : }
3784 64012 : D = absi_shallow(D);
3785 64012 : LOGD = dbllog2(D) * M_LN2;
3786 64012 : LOGD2 = LOGD*LOGD;
3787 64012 : LIMCMAX = (long)(4.*LOGD2);
3788 64012 : if (nf) PREC = maxss(PREC, nf_get_prec(nf));
3789 64012 : PREC = maxss(PREC, nbits2prec((long)(LOGD2 * 0.02) + N*N));
3790 :
3791 64012 : if (nf) PREC = maxss(PREC, nf_get_prec(nf));
3792 64012 : PREC = maxss(PREC, nbits2prec((long)(LOGD2 * 0.02) + N*N));
3793 64012 : PREC = maxss(PREC, small_norm_prec(N, LOGD, LIMCMAX));
3794 64012 : if (DEBUGLEVEL) err_printf("PREC = %ld\n", PREC);
3795 :
3796 64012 : if (!nf)
3797 60337 : nf = nfinit_complete(&nfT, flag_nfinit, PREC);
3798 3675 : else if (nf_get_prec(nf) < PREC)
3799 161 : nf = nfnewprec_shallow(nf, PREC);
3800 64014 : zu = nfrootsof1(nf);
3801 64011 : gel(zu,2) = nf_to_scalar_or_alg(nf, gel(zu,2));
3802 :
3803 64011 : nf_get_sign(nf, &R1, &R2); RU = R1+R2;
3804 64011 : auts = automorphism_matrices(nf, &cyclic);
3805 64015 : F.embperm = automorphism_perms(nf_get_M(nf), auts, cyclic, R1, R2, N);
3806 64014 : if (DEBUGLEVEL)
3807 : {
3808 0 : timer_printf(&T, "nfinit & nfrootsof1");
3809 0 : err_printf("%s bnf: R1 = %ld, R2 = %ld\nD = %Ps\n",
3810 : flag? "Algebraic": "Floating point", R1,R2, D);
3811 : }
3812 64014 : if (LOGD < 20.)
3813 : { /* tiny disc, Minkowski may be smaller than Bach */
3814 62558 : lim = exp(-N + R2 * log(4/M_PI) + LOGD/2) * sqrt(2*M_PI*N);
3815 62558 : if (lim < 3) lim = 3;
3816 : }
3817 : else /* to be ignored */
3818 1456 : lim = -1;
3819 64014 : if (cbach > 12.) {
3820 0 : if (cbach2 < cbach) cbach2 = cbach;
3821 0 : cbach = 12.;
3822 : }
3823 64014 : if (cbach < 0.)
3824 0 : pari_err_DOMAIN("Buchall","Bach constant","<",gen_0,dbltor(cbach));
3825 :
3826 64014 : cache.base = NULL; F.subFB = NULL; F.LP = NULL; SUnits = Ce = NULL;
3827 64014 : init_GRHcheck(&GRHcheck, N, R1, LOGD);
3828 64015 : high = low = LIMC0 = maxss((long)(cbach2*LOGD2), 1);
3829 312175 : while (!GRHchk(nf, &GRHcheck, high)) { low = high; high *= 2; }
3830 248200 : while (high - low > 1)
3831 : {
3832 184186 : long test = (low+high)/2;
3833 184186 : if (GRHchk(nf, &GRHcheck, test)) high = test; else low = test;
3834 : }
3835 64014 : LIMC2 = (high == LIMC0+1 && GRHchk(nf, &GRHcheck, LIMC0))? LIMC0: high;
3836 64014 : if (LIMC2 > LIMCMAX) LIMC2 = LIMCMAX;
3837 : /* Assuming GRH, {P, NP <= LIMC2} generate Cl(K) */
3838 64014 : if (DEBUGLEVEL) err_printf("LIMC2 = %ld\n", LIMC2);
3839 64015 : LIMC0 = (long)(cbach*LOGD2); /* initial value for LIMC */
3840 64015 : LIMC = cbach? LIMC0: LIMC2; /* use {P, NP <= LIMC} as a factorbase */
3841 64015 : LIMC = maxss(LIMC, nthideal(&GRHcheck, nf, N));
3842 64014 : if (DEBUGLEVEL) timer_printf(&T, "computing Bach constant");
3843 64014 : LIMres = primeneeded(N, R1, R2, LOGD);
3844 64014 : cache_prime_dec(&GRHcheck, LIMres, nf);
3845 : /* invhr ~ 2^r1 (2pi)^r2 / sqrt(D) w * Res(zeta_K, s=1) = 1 / hR */
3846 128029 : invhr = gmul(gdiv(gmul2n(powru(mppi(DEFAULTPREC), R2), RU),
3847 64013 : mulri(gsqrt(D,DEFAULTPREC),gel(zu,1))),
3848 : compute_invres(&GRHcheck, LIMres));
3849 64012 : if (DEBUGLEVEL) timer_printf(&T, "computing inverse of hR");
3850 64012 : av = avma;
3851 :
3852 66267 : START:
3853 66267 : if (DEBUGLEVEL) timer_start(&T);
3854 66267 : if (TRIES) LIMC = bnf_increase_LIMC(LIMC,LIMCMAX);
3855 66267 : if (DEBUGLEVEL && LIMC > LIMC0)
3856 0 : err_printf("%s*** Bach constant: %f\n", TRIES?"\n":"", LIMC/LOGD2);
3857 66267 : if (cache.base)
3858 : {
3859 : REL_t *rel;
3860 3838 : for (i = 1, rel = cache.base + 1; rel < cache.last; rel++)
3861 3760 : if (rel->m) i++;
3862 78 : computed = cgetg(i, t_VEC);
3863 3838 : for (i = 1, rel = cache.base + 1; rel < cache.last; rel++)
3864 3760 : if (rel->m) gel(computed, i++) = rel->m;
3865 78 : computed = gclone(computed); delete_cache(&cache);
3866 : }
3867 66267 : TRIES++; set_avma(av);
3868 66267 : if (F.LP) delete_FB(&F);
3869 66267 : if (LIMC2 < LIMC) LIMC2 = LIMC;
3870 66267 : if (DEBUGLEVEL) { err_printf("LIMC = %ld, LIMC2 = %ld\n",LIMC,LIMC2); }
3871 :
3872 66267 : FBgen(&F, nf, N, LIMC, LIMC2, &GRHcheck);
3873 66270 : if (!F.KC) goto START;
3874 66270 : av = avma;
3875 66270 : subFBgen(&F,auts,cyclic,lim < 0? LIMC2: mindd(lim,LIMC2),MINSFB);
3876 66270 : if (lg(F.subFB) == 1) goto START;
3877 64093 : if (DEBUGLEVEL)
3878 0 : timer_printf(&T, "factorbase (#subFB = %ld) and ideal permutations",
3879 0 : lg(F.subFB)-1);
3880 :
3881 64093 : fact = (FACT*)stack_malloc((F.KC+1)*sizeof(FACT));
3882 64093 : PERM = leafcopy(F.perm); /* to be restored in case of precision increase */
3883 64093 : cache.basis = zero_Flm_copy(F.KC,F.KC);
3884 64093 : small_multiplier = zero_Flv(F.KC);
3885 64093 : done_small = small_fail = squash_index = zc = sfb_trials = nreldep = 0;
3886 64093 : fail_limit = F.KC + 1;
3887 64093 : W = A = R = NULL;
3888 64093 : av2 = avma;
3889 64093 : init_rel(&cache, &F, RELSUP + RU-1);
3890 64093 : old_need = need = cache.end - cache.last;
3891 64093 : add_cyclotomic_units(nf, zu, &cache, &F);
3892 64093 : if (DEBUGLEVEL) err_printf("\n");
3893 64093 : cache.end = cache.last + need;
3894 :
3895 64093 : if (computed)
3896 : {
3897 1816 : for (i = 1; i < lg(computed); i++)
3898 1738 : try_elt(&cache, &F, nf, gel(computed, i), fact);
3899 78 : gunclone(computed);
3900 78 : if (DEBUGLEVEL && i > 1)
3901 0 : timer_printf(&T, "including already computed relations");
3902 78 : need = 0;
3903 : }
3904 :
3905 : do
3906 : {
3907 : GEN Ar, C0;
3908 : do
3909 : {
3910 122578 : pari_sp av4 = avma;
3911 122578 : if (need > 0)
3912 : {
3913 122420 : long oneed = cache.end - cache.last;
3914 : /* Test below can be true if small_norm did not find enough linearly
3915 : * dependent relations */
3916 122420 : if (need < oneed) need = oneed;
3917 122420 : pre_allocate(&cache, need+lg(auts)-1+(R ? lg(W)-1 : 0));
3918 122420 : cache.end = cache.last + need;
3919 122420 : F.L_jid = trim_list(&F);
3920 : }
3921 122579 : if (need > 0 && Nrelid > 0 && (done_small <= F.KC+1 || A) &&
3922 70385 : small_fail <= fail_limit &&
3923 70385 : cache.last < cache.base + 2*F.KC+2*RU+RELSUP /* heuristic */)
3924 : {
3925 66752 : long j, k, LIE = (R && lg(W) > 1 && (done_small % 2));
3926 66752 : REL_t *last = cache.last;
3927 66752 : pari_sp av3 = avma;
3928 66752 : if (LIE)
3929 : { /* We have full rank for class group and unit. The following tries to
3930 : * improve the prime group lattice by looking for relations involving
3931 : * the primes generating the class group. */
3932 3371 : long n = lg(W)-1; /* need n relations to squash the class group */
3933 3371 : F.L_jid = vecslice(F.perm, 1, n);
3934 3371 : cache.end = cache.last + n;
3935 : /* Lie to the add_rel subsystem: pretend we miss relations involving
3936 : * the primes generating the class group (and only those). */
3937 3371 : cache.missing = n;
3938 10526 : for ( ; n > 0; n--) mael(cache.basis, F.perm[n], F.perm[n]) = 0;
3939 : }
3940 66752 : j = done_small % (F.KC+1);
3941 66752 : if (j && !A)
3942 : { /* Prevent considering both P_iP_j and P_jP_i in small_norm */
3943 : /* Not all elements end up in F.L_jid (eliminated by hnfspec/add or
3944 : * by trim_list): keep track of which ideals are being considered
3945 : * at each run. */
3946 407 : long mj = small_multiplier[j];
3947 6359 : for (i = k = 1; i < lg(F.L_jid); i++)
3948 5952 : if (F.L_jid[i] > mj)
3949 : {
3950 5952 : small_multiplier[F.L_jid[i]] = j;
3951 5952 : F.L_jid[k++] = F.L_jid[i];
3952 : }
3953 407 : setlg(F.L_jid, k);
3954 : }
3955 66752 : if (lg(F.L_jid) > 1) small_norm(&cache, &F, nf, Nrelid, fact, j);
3956 66752 : F.L_jid = F.perm; set_avma(av3);
3957 66752 : if (!A && cache.last != last) small_fail = 0; else small_fail++;
3958 66752 : if (LIE)
3959 : { /* restore add_rel subsystem: undo above lie */
3960 3371 : long n = lg(W) - 1;
3961 10526 : for ( ; n > 0; n--) mael(cache.basis, F.perm[n], F.perm[n]) = 1;
3962 3371 : cache.missing = 0;
3963 : }
3964 66752 : cache.end = cache.last;
3965 66752 : done_small++;
3966 66752 : need = F.sfb_chg = 0;
3967 : }
3968 122579 : if (need > 0)
3969 : { /* Random relations */
3970 55669 : if (++nreldep > F.MAXDEPSIZESFB) {
3971 14 : if (++sfb_trials > SFB_MAX && LIMC < LIMCMAX/2) goto START;
3972 14 : F.sfb_chg = sfb_INCREASE;
3973 14 : nreldep = 0;
3974 : }
3975 55655 : else if (!(nreldep % F.MAXDEPSFB))
3976 26384 : F.sfb_chg = sfb_CHANGE;
3977 55669 : if (F.sfb_chg && !subFB_change(&F)) goto START;
3978 55589 : rnd_rel(&cache, &F, nf, fact);
3979 55591 : F.L_jid = F.perm;
3980 : }
3981 122501 : if (DEBUGLEVEL) timer_start(&T);
3982 122501 : if (precpb)
3983 : {
3984 : REL_t *rel;
3985 80 : if (DEBUGLEVEL)
3986 : {
3987 0 : char str[64]; sprintf(str,"Buchall_param (%s)",precpb);
3988 0 : pari_warn(warnprec,str,PREC);
3989 : }
3990 80 : nf = _nfnewprec(nf, PREC, &nfisclone);
3991 80 : precdouble++; precpb = NULL;
3992 :
3993 80 : if (flag)
3994 : { /* recompute embs only, no need to redo HNF */
3995 38 : long j, le = lg(embs), lC = lg(C);
3996 38 : GEN E, M = nf_get_M(nf);
3997 38 : set_avma(av4);
3998 12611 : for (rel = cache.base+1, i = 1; i < le; i++,rel++)
3999 12573 : gel(embs,i) = rel_embed(rel, &F, embs, i, M, RU, R1, PREC);
4000 38 : E = RgM_ZM_mul(embs, rowslice(C, RU+1, nbrows(C)));
4001 12611 : for (j = 1; j < lC; j++)
4002 65595 : for (i = 1; i <= RU; i++) gcoeff(C,i,j) = gcoeff(E,i,j);
4003 38 : av4 = avma;
4004 : }
4005 : else
4006 : { /* recompute embs + HNF */
4007 10318 : for(i = 1; i < lg(PERM); i++) F.perm[i] = PERM[i];
4008 42 : cache.chk = cache.base;
4009 42 : W = NULL;
4010 : }
4011 80 : if (DEBUGLEVEL) timer_printf(&T, "increasing accuracy");
4012 : }
4013 122501 : set_avma(av4);
4014 122501 : if (cache.chk != cache.last)
4015 : { /* Reduce relation matrices */
4016 122381 : long l = cache.last - cache.chk + 1, j;
4017 122381 : GEN mat = cgetg(l, t_MAT);
4018 : REL_t *rel;
4019 :
4020 1126160 : for (j=1,rel = cache.chk + 1; j < l; rel++,j++) gel(mat,j) = rel->R;
4021 122381 : if (!flag || W)
4022 : {
4023 59884 : embs = get_embs(&F, &cache, nf, embs, PREC);
4024 59884 : if (DEBUGLEVEL && timer_get(&T) > 1)
4025 0 : timer_printf(&T, "floating point embeddings");
4026 : }
4027 122381 : if (!W)
4028 : { /* never reduced before */
4029 64135 : C = flag? matbotid(&cache): embs;
4030 64135 : W = hnfspec_i(mat, F.perm, &dep, &B, &C, F.subFB ? lg(F.subFB)-1:0);
4031 64134 : if (DEBUGLEVEL)
4032 0 : timer_printf(&T, "hnfspec [%ld x %ld]", lg(F.perm)-1, l-1);
4033 64134 : if (flag)
4034 : {
4035 62496 : PREC += nbits2extraprec(gexpo(C));
4036 62497 : if (nf_get_prec(nf) < PREC) nf = _nfnewprec(nf, PREC, &nfisclone);
4037 62496 : embs = get_embs(&F, &cache, nf, embs, PREC);
4038 62497 : C = vconcat(RgM_ZM_mul(embs, C), C);
4039 : }
4040 64135 : if (DEBUGLEVEL)
4041 0 : timer_printf(&T, "hnfspec floating points");
4042 : }
4043 : else
4044 : {
4045 58246 : long k = lg(embs);
4046 58246 : GEN E = vecslice(embs, k-l+1,k-1);
4047 58246 : if (flag)
4048 : {
4049 55452 : E = matbotidembs(&cache, E);
4050 55452 : matenlarge(C, cache.last - cache.chk);
4051 : }
4052 58246 : W = hnfadd_i(W, F.perm, &dep, &B, &C, mat, E);
4053 58246 : if (DEBUGLEVEL)
4054 0 : timer_printf(&T, "hnfadd (%ld + %ld)", l-1, lg(dep)-1);
4055 : }
4056 122381 : (void)gc_all(av2, 5, &W,&C,&B,&dep,&embs);
4057 122381 : cache.chk = cache.last;
4058 : }
4059 120 : else if (!W)
4060 : {
4061 0 : need = old_need;
4062 0 : F.L_jid = vecslice(F.perm, 1, need);
4063 0 : continue;
4064 : }
4065 122501 : need = F.KC - (lg(W)-1) - (lg(B)-1);
4066 122501 : if (!need && cache.missing)
4067 : { /* The test above will never be true except if 27449|class number.
4068 : * Ensure that if we have maximal rank for the ideal lattice, then
4069 : * cache.missing == 0. */
4070 14 : for (i = 1; cache.missing; i++)
4071 7 : if (!mael(cache.basis, i, i))
4072 : {
4073 : long j;
4074 7 : cache.missing--; mael(cache.basis, i, i) = 1;
4075 427 : for (j = i+1; j <= F.KC; j++) mael(cache.basis, j, i) = 0;
4076 : }
4077 : }
4078 122501 : zc = (lg(C)-1) - (lg(B)-1) - (lg(W)-1);
4079 122501 : if (RU-1-zc > 0) need = minss(need + RU-1-zc, F.KC); /* for units */
4080 122501 : if (need)
4081 : { /* dependent rows */
4082 807 : F.L_jid = vecslice(F.perm, 1, need);
4083 807 : vecsmall_sort(F.L_jid);
4084 807 : if (need != old_need) { nreldep = 0; old_need = need; }
4085 : }
4086 : else
4087 : { /* If the relation lattice is too small, check will be > 1 and we will
4088 : * do a new run of small_norm/rnd_rel asking for 1 relation. This often
4089 : * gives a relation involving L_jid[1]. We rotate the first element of
4090 : * L_jid in order to increase the probability of finding relations that
4091 : * increases the lattice. */
4092 121694 : long j, n = lg(W) - 1;
4093 121694 : if (n > 1 && squash_index % n)
4094 : {
4095 8991 : F.L_jid = leafcopy(F.perm);
4096 36421 : for (j = 1; j <= n; j++)
4097 27430 : F.L_jid[j] = F.perm[1 + (j + squash_index - 1) % n];
4098 : }
4099 : else
4100 112703 : F.L_jid = F.perm;
4101 121694 : squash_index++;
4102 : }
4103 : }
4104 122501 : while (need);
4105 :
4106 121694 : if (!A)
4107 : {
4108 64100 : small_fail = old_need = 0;
4109 64100 : fail_limit = maxss(F.KC / FAIL_DIVISOR, MINFAIL);
4110 : }
4111 121694 : A = vecslice(C, 1, zc); /* cols corresponding to units */
4112 121694 : if (flag) A = rowslice(A, 1, RU);
4113 121694 : Ar = real_i(A);
4114 121694 : R = compute_multiple_of_R(Ar, RU, N, &need, &bit, &lambda);
4115 121693 : if (need < old_need) small_fail = 0;
4116 : #if 0 /* A good idea if we are indeed stuck but needs tuning */
4117 : /* we have computed way more relations than should be necessary */
4118 : if (TRIES < 3 && LIMC < LIMCMAX / 8 &&
4119 : cache.last - cache.base > 10 * F.KC) goto START;
4120 : #endif
4121 121693 : old_need = need;
4122 121693 : if (!lambda)
4123 11 : { precpb = "bestappr"; PREC = myprecdbl(PREC, flag? C: NULL); continue; }
4124 121682 : if (!R)
4125 : { /* not full rank for units */
4126 25381 : if (!need)
4127 0 : { precpb = "regulator"; PREC = myprecdbl(PREC, flag? C: NULL); }
4128 25381 : continue;
4129 : }
4130 96301 : if (cache.last==old_cache) { need=1; continue; }
4131 96216 : old_cache = cache.last;
4132 96216 : h = ZM_det_triangular(W);
4133 96216 : if (DEBUGLEVEL) err_printf("\n#### Tentative class number: %Ps\n", h);
4134 96216 : i = compute_R(lambda, mulir(h,invhr), &L, &R);
4135 96215 : if (DEBUGLEVEL)
4136 : {
4137 0 : err_printf("\n");
4138 0 : timer_printf(&T, "computing regulator and check");
4139 : }
4140 96217 : switch(i)
4141 : {
4142 32133 : case fupb_RELAT:
4143 32133 : need = 1; /* not enough relations */
4144 32133 : continue;
4145 62 : case fupb_PRECI: /* prec problem unless we cheat on Bach constant */
4146 62 : if ((precdouble&7) == 7 && LIMC <= LIMCMAX/2) goto START;
4147 62 : precpb = "compute_R"; PREC = myprecdbl(PREC, flag? C: NULL);
4148 62 : continue;
4149 : }
4150 : /* DONE */
4151 :
4152 64022 : if (F.KCZ2 > F.KCZ)
4153 : {
4154 7 : if (F.sfb_chg && !subFB_change(&F)) goto START;
4155 7 : if (!be_honest(&F, nf, auts, fact)) goto START;
4156 7 : if (DEBUGLEVEL) timer_printf(&T, "to be honest");
4157 : }
4158 64022 : F.KCZ2 = 0; /* be honest only once */
4159 :
4160 : /* fundamental units */
4161 : {
4162 64022 : GEN AU, CU, U, v = extract_full_lattice(L); /* L may be large */
4163 64022 : CU = NULL;
4164 64022 : if (v) { A = vecpermute(A, v); L = vecpermute(L, v); }
4165 : /* arch. components of fund. units */
4166 64022 : U = ZM_lll(L, 0.99, LLL_IM);
4167 64022 : U = ZM_mul(U, lll(RgM_ZM_mul(real_i(A), U)));
4168 64021 : if (DEBUGLEVEL) timer_printf(&T, "units LLL");
4169 64021 : AU = RgM_ZM_mul(A, U);
4170 64022 : A = cleanarchunit(AU, N, NULL, PREC);
4171 64021 : if (RU > 1 /* if there are fund units, test we have correct regulator */
4172 48803 : && (!A || lg(A) < RU || expo(subrr(get_regulator(A), R)) > -1))
4173 7 : {
4174 7 : long add = nbits2extraprec( gexpo(AU) + 64 ) - gprecision(AU);
4175 7 : long t = maxss(PREC * 0.15, add);
4176 7 : if (!A && DEBUGLEVEL) err_printf("### Incorrect units lognorm");
4177 7 : precpb = "cleanarch"; PREC += maxss(t, EXTRAPREC64); continue;
4178 : }
4179 64014 : if (flag)
4180 : {
4181 62432 : long l = lgcols(C) - RU;
4182 : REL_t *rel;
4183 62432 : SUnits = cgetg(l, t_COL);
4184 1010073 : for (rel = cache.base+1, i = 1; i < l; i++,rel++)
4185 947640 : set_rel_alpha(rel, auts, SUnits, i);
4186 62433 : if (RU > 1)
4187 : {
4188 47719 : GEN c = v? vecpermute(C,v): vecslice(C,1,zc);
4189 47719 : CU = ZM_mul(rowslice(c, RU+1, nbrows(c)), U);
4190 : }
4191 : }
4192 64015 : if (DEBUGLEVEL) err_printf("\n#### Computing fundamental units\n");
4193 64015 : fu = getfu(nf, &A, CU? &U: NULL, PREC);
4194 64015 : CU = CU? ZM_mul(CU, U): cgetg(1, t_MAT);
4195 64015 : if (DEBUGLEVEL) timer_printf(&T, "getfu");
4196 64015 : Ce = vecslice(C, zc+1, lg(C)-1);
4197 64015 : if (flag) SUnits = mkvec4(SUnits, CU, rowslice(Ce, RU+1, nbrows(Ce)),
4198 : utoipos(LIMC));
4199 : }
4200 : /* class group generators */
4201 64015 : if (flag) Ce = rowslice(Ce, 1, RU);
4202 64015 : C0 = Ce; Ce = cleanarch(Ce, N, NULL, PREC);
4203 64014 : if (!Ce) {
4204 0 : long add = nbits2extraprec( gexpo(C0) + 64 ) - gprecision(C0);
4205 0 : precpb = "cleanarch"; PREC += maxss(add, 1);
4206 : }
4207 64014 : if (DEBUGLEVEL) timer_printf(&T, "cleanarch");
4208 121692 : } while (need || precpb);
4209 :
4210 64014 : Vbase = vecpermute(F.LP, F.perm);
4211 64014 : if (!fu) fu = cgetg(1, t_MAT);
4212 64014 : if (!SUnits) SUnits = gen_1;
4213 64014 : clg1 = class_group_gen(nf,W,Ce,Vbase,PREC, &clg2);
4214 64014 : res = mkvec5(clg1, R, SUnits, zu, fu);
4215 64014 : res = buchall_end(nf,res,clg2,W,B,A,Ce,Vbase);
4216 64014 : delete_FB(&F);
4217 64015 : res = gc_GEN(av0, res);
4218 64015 : if (flag) obj_insert_shallow(res, MATAL, cgetg(1,t_VEC));
4219 64015 : if (nfisclone) gunclone(nf);
4220 64015 : delete_cache(&cache);
4221 64015 : free_GRHcheck(&GRHcheck);
4222 64015 : return res;
4223 : }
|
