newf4::MacaulayMatrix — batched matrix of S-polynomials and tail-reducers (refactor stub). More...

#include "MonomialHashTable.hpp"

Classes
class	newf4::MacaulayMatrix
struct	newf4::Column
struct	newf4::Row

Namespaces
namespace	newf4

Detailed Description

newf4::MacaulayMatrix — batched matrix of S-polynomials and tail-reducers (refactor stub).

Note: AI-generated documentation. Verify against the source before relying on it.

Declares the F4-side Macaulay matrix the new GB engine row-reduces once per degree: rows are S-polynomials together with selected basis tail-reducers, columns are the monomials appearing in any row sorted by the monomial order, and entries are sparse coefficients drawn from the VectorArithmetic backend. Each echelon row whose leading column is new is promoted to a basis element; the matrix is then discarded and the driver advances to the next degree. This is the batching that makes F4 fast — instead of reducing one S-polynomial at a time, every pair of the current degree shares its tail- reduction work through the matrix.

Header is intentionally minimal at this point in the refactor (the Row / Column structs are placeholders, and only the mMonomials column-index table is populated); see the TODO-refactor-f4 note in this subdir for the planned API. The mature counterpart in f4/ still lives next door.

See also: MonomialHashTable.hpp; GBF4Computation.hpp; SPairs.hpp; Basis.hpp

Definition in file MacaulayMatrix.hpp.

Classes

Namespaces

Detailed Description