flag-algebra 0.1.0

An implementation of Razborov's flag algebras
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79

extern crate flag_algebra;

use flag_algebra::*;
use crate::flags::*;
use crate::operator::*;

fn identity1<F>(t: Type, n: usize)
    where F: Flag
{
    let b = Basis::<F>::make(n, t);
    let x : QFlag<i64,_> = b.random();
    let y = b.random();
    assert_eq!(&(&x - &y) * &(x),
               (&(&x * &x) - &((&y * &x))));
}

fn commute<F>(t: Type, n1: usize, n2: usize)
    where F: Flag
{
    let b1 = Basis::<F>::make(n1, t);
    let b2 = Basis::<F>::make(n2, t);
    let x : QFlag<i64,_> = b1.random();
    let y : QFlag<i64,_> = b2.random();
    assert_eq!(&x * &y, &y * &x)
}

fn assoc<F>(t: Type, n1: usize, n2: usize, n3: usize)
    where F: Flag
{
    let b1 = Basis::<F>::make(n1, t);
    let b2 = Basis::<F>::make(n2, t);
    let b3 = Basis::<F>::make(n3, t);
    let x : QFlag<i64,_> = b1.random();
    let y : QFlag<i64,_> = b2.random();
    let z : QFlag<i64,_> = b3.random();
    assert_eq!(&(&x * &y) * &z, &x * &(&y  * &z))
}

fn transitive<F>(t: Type, n1: usize, n2: usize, n3: usize)
    where F: Flag
{
    let b1 = Basis::<F>::make(n1, t);
    let b2 = Basis::<F>::make(n2, t);
    let b3 = Basis::<F>::make(n3, t);
    let x : QFlag<i64,_> = b1.random();
    assert_eq!( x.expand(b2).expand(b3), x.expand(b3) )
}

#[test]
pub fn identities() {
    let t1 = Type::new(1,0);
    identity1::<Graph>(Type::empty(), 2);
    identity1::<Graph>(t1, 2);
}

#[test]
pub fn mul_commutativity() {
    let t1 = Type::new(1,0);
    commute::<Graph>(t1, 3, 2);
    commute::<Graph>(Type::empty(), 2, 3);
    commute::<Digraph>(t1, 3, 2);
}

#[test]
pub fn mul_associativity() {
    let t1 = Type::new(1,0);
    assoc::<Graph>(t1, 2, 2, 2);
    assoc::<Graph>(Type::empty(), 2, 1, 2);
    assoc::<Digraph>(t1, 2, 1, 2);
}


#[test]
pub fn untype_transitivity() {
    let t1 = Type::new(1,0);
    transitive::<Graph>(t1, 3, 4, 5);
    transitive::<Graph>(Type::empty(), 2, 3, 5);
    transitive::<Digraph>(t1, 3, 4, 5);
}