Struct Monomial 

pub struct Monomial {
    pub exponents: Vec<u32>,
}

Fields

exponents: Vec<u32>

Implementations

impl Monomial

pub fn new(exponents: Vec<u32>) -> Self

Examples found in repository

examples/basic.rs (line 16)

fn main() {
    // Example: Compute a Groebner basis for the ideal (x^2 + y^2 - 1, x - y)
    // Variables: x = 0, y = 1
    let nvars = 2;
    let order = MonomialOrder::Lex;

    // x^2 + y^2 - 1
    let f = Polynomial::new(
        vec![
            Term::new(
                BigRational::new(1.into(), 1.into()),
                Monomial::new(vec![2, 0]),
            ), // x^2
            Term::new(
                BigRational::new(1.into(), 1.into()),
                Monomial::new(vec![0, 2]),
            ), // y^2
            Term::new(
                BigRational::new((-1).into(), 1.into()),
                Monomial::new(vec![0, 0]),
            ), // -1
        ],
        nvars,
        order,
    );

    // x - y
    let g = Polynomial::new(
        vec![
            Term::new(
                BigRational::new(1.into(), 1.into()),
                Monomial::new(vec![1, 0]),
            ), // x
            Term::new(
                BigRational::new((-1).into(), 1.into()),
                Monomial::new(vec![0, 1]),
            ), // -y
        ],
        nvars,
        order,
    );

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

pub fn one(nvars: usize) -> Self

pub fn nvars(&self) -> usize

pub fn degree(&self) -> u32

pub fn multiply(&self, other: &Self) -> Self

pub fn divides(&self, other: &Self) -> bool

pub fn divide(&self, other: &Self) -> Option<Self>

pub fn lcm(&self, other: &Self) -> Self

pub fn compare(&self, other: &Self, order: MonomialOrder) -> Ordering

Trait Implementations

impl Clone for Monomial

fn clone(&self) -> Monomial

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Monomial

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Monomial

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for Monomial

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Monomial

fn eq(&self, other: &Monomial) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Monomial

impl StructuralPartialEq for Monomial