n_polyu_fq_is_canonical, n_polyun_fq_is_canonical, n_polyu3_fq_print_pretty, n_polyu2n_fq_print_pretty, n_polyu3n_fq_print_pretty
Synopsis
#include <flint/fq_nmod_mpoly_factor.h>int n_polyu_fq_is_canonical(const n_polyu_t A, const fq_nmod_ctx_t ctx)sourceint n_polyun_fq_is_canonical(const n_polyun_t A, const fq_nmod_ctx_t ctx)sourcevoid n_polyu3_fq_print_pretty(const n_polyu_t A, const char * var0, const char * var1, const char * var2, const fq_nmod_ctx_t ctx)sourcevoid n_polyu2n_fq_print_pretty(const n_polyun_t A, const char * var0, const char * var1, const char * varlast, const fq_nmod_ctx_t ctx)sourcevoid n_polyu3n_fq_print_pretty(const n_polyun_t A, const char * var0, const char * var1, const char * var2, const char * varlast, const fq_nmod_ctx_t ctx)sourceConsistency checks and printing of sparse polynomials with n_fq coefficients.
Cite this page
The FLINT team, “n_polyu_fq_is_canonical, n_polyun_fq_is_canonical, n_polyu3_fq_print_pretty, n_polyu2n_fq_print_pretty, n_polyu3n_fq_print_pretty (fq_nmod_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_mpoly_factor/n_polyu_fq_is_canonical.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-mpoly-factor-n-polyu-fq-is-canonical,
author = {{The FLINT team}},
title = {{n\_polyu\_fq\_is\_canonical, n\_polyun\_fq\_is\_canonical, n\_polyu3\_fq\_print\_pretty, n\_polyu2n\_fq\_print\_pretty, n\_polyu3n\_fq\_print\_pretty (fq\_nmod\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_mpoly_factor/n_polyu_fq_is_canonical.html},
note = {Generated 2026-10-20}
}