Struct GroebnerSimplifier 

pub struct GroebnerSimplifier { /* private fields */ }

Simplifies expressions using Groebner basis reduction.

This struct computes a Groebner basis from constraint polynomials and uses it to reduce (simplify) product expressions.

Safety

The simplifier validates reduced expressions to ensure:

• Coefficients don’t explode (within MAX_COEFFICIENT_MAGNITUDE)
• The reduced form is actually simpler (fewer terms)

If validation fails, it falls back to the original expression.

Implementations

impl GroebnerSimplifier

pub fn new(constraints: Vec<Atom>, _use_grevlex: bool) -> Self

Creates a simplifier from constraint atoms.

Arguments

• constraints - Atom expressions that must equal zero
• use_grevlex - Use grevlex ordering (faster) vs lex (better elimination)

Returns

A simplifier ready to reduce expressions. If constraints are empty or too numerous, returns a disabled simplifier that passes through unchanged.

pub fn is_enabled(&self) -> bool

Returns true if this simplifier is enabled.

pub fn reduce_atom(&self, expr: &Atom) -> Atom

Reduces an expression modulo the Groebner basis.

This is the main simplification method. It converts the expression to a polynomial, reduces it using the Groebner basis, then converts back.

Arguments

• expr - The expression to reduce

Returns

The reduced expression, or the original if reduction fails or is disabled.

pub fn reduce_safe(&self, expr: &Atom) -> ReductionResult

Reduces an expression with validation and fallback.

This method performs reduction and validates the result. If validation fails (e.g., coefficient explosion), it falls back to the original.