Computes the top dimensional part of a chordal network.
i1 : I = toLex edgeIdeal cycleGraph 9 o1 = ideal (x x , x x , x x , x x , x x , x x , x x , x x , x x ) 1 2 2 3 3 4 4 5 5 6 6 7 7 8 1 9 8 9 o1 : Ideal of QQ[x ..x ] 1 9 |
i2 : N = chordalNet I; |
i3 : chordalTria N; |
i4 : codimCount N 8 7 6 5 o4 = t + 9t + 20t + 9t o4 : ZZ[t] |
i5 : topComponents N |
i6 : codimCount N 5 o6 = 9t o6 : ZZ[t] |