fq_zech_mpoly_divides, fq_zech_mpoly_divides_monagan_pearce
Synopsis
#include <flint/fq_zech_mpoly.h>int fq_zech_mpoly_divides(fq_zech_mpoly_t Q, const fq_zech_mpoly_t A, const fq_zech_mpoly_t B, const fq_zech_mpoly_ctx_t ctx)sourceint fq_zech_mpoly_divides_monagan_pearce(fq_zech_mpoly_t poly1, const fq_zech_mpoly_t poly2, const fq_zech_mpoly_t poly3, const fq_zech_mpoly_ctx_t ctx)sourceIf B divides A, set Q (poly1) to the quotient and return 1; otherwise return 0. Uses the heap algorithm of Monagan and Pearce [MonPea2011].
References#
- [MonPea2011] M. Monagan and R. Pearce. Sparse polynomial division using a heap. Journal of Symbolic Computation 46:7 (2011), 807–822. https://doi.org/10.1016/j.jsc.2010.08.014
Cite this page
The FLINT team, “fq_zech_mpoly_divides, fq_zech_mpoly_divides_monagan_pearce (fq_zech_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_zech_mpoly/fq_zech_mpoly_divides.html (generated 2026-10-20).
@misc{flint-doc-fq-zech-mpoly-fq-zech-mpoly-divides,
author = {{The FLINT team}},
title = {{fq\_zech\_mpoly\_divides, fq\_zech\_mpoly\_divides\_monagan\_pearce (fq\_zech\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_zech_mpoly/fq_zech_mpoly_divides.html},
note = {Generated 2026-10-20}
}