gr_mat_is_row_lll_reduced_naive, gr_mat_is_row_lll_reduced_with_removal_naive
#include <flint/gr_mat.h>truth_t gr_mat_is_row_lll_reduced_naive(const gr_mat_t A, gr_srcptr delta, gr_srcptr eta, gr_ctx_t ctx)sourcetruth_t gr_mat_is_row_lll_reduced_with_removal_naive(const gr_mat_t A, gr_srcptr delta, gr_srcptr eta, gr_srcptr gs_B, slong newd, gr_ctx_t ctx)sourceReturn whether the rows of A are LLL-reduced with parameters (\delta, \eta), by Gram-Schmidt orthogonalisation in the ring and checking the conditions row by row. The with_removal version checks only the first newd rows, as needed when rows whose Gram-Schmidt norm exceeds the bound gs_B are to be removed (as in fmpz_lll).
With interval arithmetic these functions stop early: T_UNKNOWN is returned as soon as the test of one row is inconclusive, even if a later row would show that the answer is T_FALSE.
The FLINT team, “gr_mat_is_row_lll_reduced_naive, gr_mat_is_row_lll_reduced_with_removal_naive (gr_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_mat/gr_mat_is_row_lll_reduced_naive.html (generated 2026-10-20).
@misc{flint-doc-gr-mat-gr-mat-is-row-lll-reduced-naive,
author = {{The FLINT team}},
title = {{gr\_mat\_is\_row\_lll\_reduced\_naive, gr\_mat\_is\_row\_lll\_reduced\_with\_removal\_naive (gr\_mat.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/gr_mat/gr_mat_is_row_lll_reduced_naive.html},
note = {Generated 2026-10-20}
}