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
58
59
60
61
62
63
64
65
66
67
68
69
70
|
/*
Copyright (C) 2016 Pascal Molin
This file is part of Arb.
Arb is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version. See <http://www.gnu.org/licenses/>.
*/
#include "dirichlet.h"
static void
dirichlet_exponents_char(ulong * expo, const dirichlet_group_t G, const dirichlet_char_t chi, ulong order)
{
slong k;
ulong factor = G->expo / order;
for (k = 0; k < G->num; k++)
/* no overflow: log[k] < phi[k] and G->expo = phi[k] * PHI[k] */
expo[k] = (chi->log[k] * G->PHI[k]) / factor;
}
/* loop over whole group */
void
dirichlet_chi_vec_loop_order(ulong * v, const dirichlet_group_t G, const dirichlet_char_t chi, ulong order, slong nv)
{
int j;
ulong t;
slong k;
ulong expo[MAX_FACTORS];
dirichlet_char_t x;
nmod_t o;
dirichlet_char_init(x, G);
dirichlet_char_one(x, G);
dirichlet_exponents_char(expo, G, chi, order);
nmod_init(&o, order);
for (k = 0; k < nv; k++)
v[k] = DIRICHLET_CHI_NULL;
t = v[1] = 0;
while ( (j = dirichlet_char_next(x, G)) >= 0 )
{
/* exponents were modified up to j */
for (k = G->num - 1; k >= j; k--)
t = nmod_add(t, expo[k], o);
if (x->n < nv)
v[x->n] = t;
}
/* fix result outside primes */
/* dirichlet_vec_set_null(v, G, nv);*/
/* copy outside modulus */
for (k = G->q; k < nv ; k++ )
v[k] = v[k - G->q];
dirichlet_char_clear(x);
}
void
dirichlet_chi_vec_loop(ulong * v, const dirichlet_group_t G, const dirichlet_char_t chi, slong nv)
{
dirichlet_chi_vec_loop_order(v, G, chi, G->expo, nv);
}
|
