`fmpz_poly_hensel_lift_tree`

Synopsis#include <flint/fmpz_poly.h>

void fmpz_poly_hensel_lift_tree(slong * link, fmpz_poly_t * v, fmpz_poly_t * w, fmpz_poly_t f, slong r, const fmpz_t p, slong e0, slong e1, slong inv)

source

Lifts the whole Hensel tree for the $r$ factors of the monic $f$ from $p^{e_0}$ to $p^{e_1}$ , where $e_0 < e_1 \le 2 e_0$ , by calling fmpz_poly_hensel_lift_tree_recursive at the root with $p_0 = p^{e_0}$ and $p_1 = p^{e_1 - e_0}$ . inv is as for that function.

Cite this page

The FLINT team, “fmpz_poly_hensel_lift_tree (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/fmpz_poly_hensel_lift_tree.html (generated 2026-11-02).

@misc{flint-doc-fmpz-poly-fmpz-poly-hensel-lift-tree,
  author       = {{The FLINT team}},
  title        = {{fmpz\_poly\_hensel\_lift\_tree (fmpz\_poly.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/fmpz_poly/fmpz_poly_hensel_lift_tree.html},
  note         = {Generated 2026-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95