acb_dirichlet_dft_index
Synopsis
#include <flint/acb_dirichlet.h>void acb_dirichlet_dft_index(acb_ptr w, acb_srcptr v, const dirichlet_group_t G, slong prec)sourceSets w to the DFT of v, both vectors of length \phi(q) indexed by the lexicographically ordered Conrey logarithms (the order of dirichlet_char_next and dirichlet_char_index).
For example, for q = 15 the elements are stored in the following order:
| index | log = [e, f] | number = 7^e 11^f |
|---|---|---|
| 0 | [0, 0] | 1 |
| 1 | [0, 1] | 7 |
| 2 | [0, 2] | 4 |
| 3 | [0, 3] | 13 |
| 4 | [1, 0] | 11 |
| 5 | [1, 1] | 2 |
| 6 | [1, 2] | 14 |
| 7 | [1, 3] | 8 |
Cite this page
The FLINT team, “acb_dirichlet_dft_index (acb_dirichlet.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_dirichlet/acb_dirichlet_dft_index.html (generated 2026-10-20).
@misc{flint-doc-acb-dirichlet-acb-dirichlet-dft-index,
author = {{The FLINT team}},
title = {{acb\_dirichlet\_dft\_index (acb\_dirichlet.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/acb_dirichlet/acb_dirichlet_dft_index.html},
note = {Generated 2026-10-20}
}