blob: 2e73af4ed9ae8279226c704adc829661052e0078 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
// Prints Hilbert polynomials H_D(X)
//
// Usage: hilbertpoly [LOWER [UPPER]]
//
// LOWER:
// Lower limit of D. Defaults to 3.
// UPPER:
// Upper limit of D. Defaults to LOWER.
//
// e.g. $ hilbertpoly 3 1000000
#include <stdarg.h>
#include <stdio.h>
#include <stdint.h> // for intptr_t
#include <stdlib.h> //for atoi, exit
#include <gmp.h>
#include "pbc_utils.h"
#include "pbc_hilbert.h"
static void xpow(int degree) {
if (degree == 1) {
printf("X");
} else if (degree) {
printf("X^%d", degree);
}
}
int main(int argc, char **argv) {
int D = argc > 1 ? atoi(argv[1]) : 3;
if (D <= 0) pbc_die("D must be positive.");
int Dlimit = argc > 2 ? atoi(argv[2]) : D;
for(; D <= Dlimit; D++) {
mpz_t *coefflist;
int m = D % 4;
if (m == 1 || m == 2) continue;
printf("D = %d\n", D);
int n = pbc_hilbert(&coefflist, D);
printf(" ");
xpow(n - 1);
printf("\n");
int i;
for (i = n - 2; i >= 0; i--) {
if (mpz_sgn(coefflist[i]) >= 0) {
printf("+");
}
mpz_out_str(stdout, 0, coefflist[i]);
xpow(i);
printf("\n");
}
pbc_hilbert_free(coefflist, n);
}
return 0;
}
|
