Module algorithms 

Polynomial Algorithm Implementations

This module contains the core polynomial algorithms:

• GCD (pure i64 only)
• Factorization (square-free, pure Poly<T>)
• Zippel modular GCD (industrial-strength, pure numeric)

Expression-based GCD operations MOVED TO ALGEBRA LAYER:

• polynomial_gcd, univariate_gcd → algebra::gcd
• resultant, discriminant → algebra::polynomial_advanced::AdvancedPolynomial
• content extraction, factor_numeric → algebra::polynomial_advanced::AdvancedPolynomial

Re-exports

pub use crate::algebra::gcd::polynomial_gcd;

pub use crate::algebra::gcd::univariate_gcd;

pub use crate::algebra::gcd::univariate_gcd_modular;

pub use zippel_gcd::modular_gcd_univariate;

pub use zippel_gcd::primitive_part;

pub use zippel_gcd::trial_divide;

pub use zippel_gcd::verify_gcd_candidate;

pub use zippel_gcd::TrialDivisionResult;

pub use zippel_gcd::analyze_sparsity;

pub use zippel_gcd::is_sparse;

pub use zippel_gcd::sparse_multiply;

pub use zippel_gcd::SparsityInfo;

pub use resultant::AdvancedPolynomial;

Modules

zippel_gcd

Zippel’s Modular GCD Algorithm

Functions

integer_gcd

Integer GCD using binary Euclidean algorithm

square_free_factorization_poly

Square-free factorization using Yun’s algorithm