fq_nmod_ctx_init_minimal_weight_ui
Synopsis
#include <flint/fq_nmod.h>void fq_nmod_ctx_init_minimal_weight_ui(fq_nmod_ctx_t ctx, ulong prime, slong deg, const char * var)sourceInitialises ctx with a monic irreducible polynomial of degree d with the least possible number of nonzero terms, as computed by nmod_poly_minimal_irreducible: a binomial x^d + a if one exists, otherwise a trinomial, tetranomial or pentanomial, the smallest in a fixed order. The polynomial is deterministic but in general not primitive.
Cite this page
The FLINT team, “fq_nmod_ctx_init_minimal_weight_ui (fq_nmod.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod/fq_nmod_ctx_init_minimal_weight_ui.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-fq-nmod-ctx-init-minimal-weight-ui,
author = {{The FLINT team}},
title = {{fq\_nmod\_ctx\_init\_minimal\_weight\_ui (fq\_nmod.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod/fq_nmod_ctx_init_minimal_weight_ui.html},
note = {Generated 2026-10-20}
}