_fmpz_mpoly_factor_squarefree
Synopsis
#include <flint/fmpz_mpoly_factor.h>int _fmpz_mpoly_factor_squarefree(fmpz_mpoly_factor_t f, fmpz_mpoly_t A, const fmpz_t e, const fmpz_mpoly_ctx_t ctx)sourceAppends a squarefree factorisation of A^e to f, where A is primitive with respect to each variable. Constant and monomial A are handled directly; otherwise Yun's algorithm [Yun1976] is run with respect to the first variable in which A has a nonzero derivative. A is destroyed. Returns 0 if a GCD failed for every variable.
References#
- [Yun1976] D. Y. Y. Yun. On square-free decomposition algorithms. Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation (SYMSAC '76), 26–35. https://doi.org/10.1145/800205.806320
Cite this page
The FLINT team, “_fmpz_mpoly_factor_squarefree (fmpz_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly_factor/_fmpz_mpoly_factor_squarefree.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-factor-fmpz-mpoly-factor-squarefree,
author = {{The FLINT team}},
title = {{\_fmpz\_mpoly\_factor\_squarefree (fmpz\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mpoly_factor/_fmpz_mpoly_factor_squarefree.html},
note = {Generated 2026-10-20}
}