Question

我的工作是解决在第5个分圆场中计算理想的范数，（表示为K5）polcyclo（5）定义场的多项式在PARI / GP中是成功的。我还能够找到它的主要生成器并计算更多（第三和第四行的命令）。

(09:24) gp > J = idealhnf(bnfinit(polcyclo(5)),11,x-3);
(09:24) gp > idealnorm(bnfinit(polcyclo(5)),J)
%16 = 11
(09:24) gp > Jp = bnfisprincipal(bnfinit(polcyclo(5)),J)
%17 = [[]~, [1, -1, -1, 0]~]
(09:24) gp > u = nfbasistoalg(bnfinit(polcyclo(5)),Jp[2])
%18 = Mod(-x^2 - x + 1, x^4 + x^3 + x^2 + x + 1)
(09:24) gp >

我想以相同的速度为K179执行相同的任务，但这不起作用。 PARI / GP有什么问题？我需要另一个程序吗？

(09:25) gp > J = idealhnf(bnfinit(polcyclo(179)),359,x-2);
  ***   at top-level: J=idealhnf(bnfinit(polcyclo(179
  ***                            ^--------------------
  *** bnfinit: the PARI stack overflows !
  current stack size: 16000000 (15.259 Mbytes)
  [hint] you can increase GP stack with allocatemem()

(09:26) gp > idealnorm(bnfinit(polcyclo(179)),J)
  ***   at top-level: idealnorm(bnfinit(polcyclo(179
  ***                           ^--------------------
  *** bnfinit: the PARI stack overflows !
  current stack size: 16000000 (15.259 Mbytes)
  [hint] you can increase GP stack with allocatemem()

(09:27) gp > Jp = bnfisprincipal(bnfinit(polcyclo(179)),J)
  ***   at top-level: Jp=bnfisprincipal(bnfinit(polcyclo(179
  ***                                   ^--------------------
  *** bnfinit: the PARI stack overflows !
  current stack size: 16000000 (15.259 Mbytes)
  [hint] you can increase GP stack with allocatemem()

(09:28) gp > u = nfbasistoalg(bnfinit(polcyclo(179)),Jp[2])
  ***   at top-level: u=nfbasistoalg(bnfinit(polcyclo(179
  ***                                ^--------------------
  *** bnfinit: the PARI stack overflows !
  current stack size: 16000000 (15.259 Mbytes)
  [hint] you can increase GP stack with allocatemem()

(09:29) gp >

我还将堆栈大小增加到1024000000（最大值），它仍然会产生相同的溢出错误。有谁知道我应该怎么做才能正确执行所有四个计算？提前谢谢。

GP中的堆栈溢出错误

0 个答案: