buchberger 0.1.0

Provides polynomial operation and buchberger's algorithm implementation
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

use buchberger::{groebner, PolyRing, F};
use ordered_float::NotNan;

/// Wrap float as Field
fn f(x: f64) -> F<NotNan<f64>> {
    F(NotNan::new(x).unwrap())
}

fn main() {
    /*{
        let poly_ring = PolyRing::<F<NotNan<f64>>>::new(vec!["x", "y"]);
        let x = poly_ring.variables();
        let f1 = x[0].clone() * x[1].clone() + x[1].clone() * f(2.0);
        let f2 = x[1].clone() * f(2.0) + x[0].clone() * x[0].clone();
        println!("f1={}, f2={}", f1, f2);
        println!("S={}", f1.s_polynomial(&f2));
    }*/
    {
        let poly_ring = PolyRing::<F<NotNan<f64>>>::new(vec!["a", "b", "c", "λ"]);
        let x = poly_ring.variables();

        let g1 = x[0].clone() + x[1].clone() + x[2].clone() - f(2.0);
        let g2 = x[1].clone() * x[2].clone() - x[1].clone() - x[2].clone() + x[3].clone() + f(1.0);
        let g3 = x[0].clone() * x[1].clone() - x[0].clone() - x[1].clone() + x[3].clone() + f(1.0);
        let g4 = x[2].clone() * x[0].clone() - x[2].clone() - x[0].clone() + x[3].clone() + f(1.0);

        println!("g1={}, g2={}, g3={}, g4={}", g1, g2, g3, g4);
        println!("S={}", g1.s_polynomial(&g2));

        let mut ideal = vec![g1, g2, g3, g4];
        groebner(&mut ideal);
        for (i, poly) in ideal.iter().enumerate() {
            println!("g{}={},", i + 1, poly);
        }
    }
}