fq_nmod_mpoly_factor_squarefree, fq_nmod_mpoly_factor_separable
Synopsis
#include <flint/fq_nmod_mpoly_factor.h>int fq_nmod_mpoly_factor_squarefree(fq_nmod_mpoly_factor_t f, const fq_nmod_mpoly_t A, const fq_nmod_mpoly_ctx_t ctx)sourceint fq_nmod_mpoly_factor_separable(fq_nmod_mpoly_factor_t f, const fq_nmod_mpoly_t A, const fq_nmod_mpoly_ctx_t ctx, int sep)sourceSet f to a factorisation with squarefree, pairwise coprime bases. With sep = 1, fq_nmod_mpoly_factor_separable also makes each base g satisfy \partial g/\partial x_i = 0 or \gcd(g, \partial g/\partial x_i) = 1 for every variable, as nmod_mpoly_factor_separable.
Cite this page
The FLINT team, “fq_nmod_mpoly_factor_squarefree, fq_nmod_mpoly_factor_separable (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/fq_nmod_mpoly_factor_squarefree.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-mpoly-factor-fq-nmod-mpoly-factor-squarefree,
author = {{The FLINT team}},
title = {{fq\_nmod\_mpoly\_factor\_squarefree, fq\_nmod\_mpoly\_factor\_separable (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/fq_nmod_mpoly_factor_squarefree.html},
note = {Generated 2026-10-20}
}