groebner 0.1.2

A Rust library implementing Groebner basis algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

extern crate groebner;
use groebner::{groebner_basis, MonomialOrder, PolynomialRing};
use num_rational::BigRational;

fn main() {
    // Example: Compute a Groebner basis for the ideal (x^2 + y^2 - 1, x - y)
    let order = MonomialOrder::Lex;
    let ring = match PolynomialRing::<BigRational>::new(["x", "y"], order) {
        Ok(ring) => ring,
        Err(e) => {
            println!("Error creating polynomial ring: {e}");
            return;
        }
    };
    let f = match ring.parse("x^2 + y^2 - 1") {
        Ok(polynomial) => polynomial,
        Err(e) => {
            println!("Error parsing first polynomial: {e}");
            return;
        }
    };
    let g = match ring.parse("x - y") {
        Ok(polynomial) => polynomial,
        Err(e) => {
            println!("Error parsing second polynomial: {e}");
            return;
        }
    };

    // Compute the Groebner basis
    match groebner_basis(vec![f, g], order, true) {
        Ok(basis) => {
            println!("Groebner basis:");
            for (i, poly) in basis.iter().enumerate() {
                match ring.format(poly) {
                    Ok(formatted) => println!("g{}: {}", i + 1, formatted),
                    Err(e) => println!("Error formatting g{}: {e}", i + 1),
                }
            }
        }
        Err(e) => {
            println!("Error computing Groebner basis: {e}");
        }
    }
}