isCM -- determines if a (hyper)graph is Cohen-Macaulay

Synopsis

• Usage:

  b = isCM H

• Inputs:
  • H, a hypergraph,
• Outputs:
  • b, a Boolean value, true if the edgeIdeal of H is Cohen-Macaulay

Description

i1 : R = QQ[a..e];

i2 : C = cycle R;

i3 : UnmixedTree = graph {a*b, b*c, c*d};

i4 : MixedTree = graph {a*b, a*c, a*d};

i5 : isCM C

o5 = true

i6 : isCM UnmixedTree

o6 = true

i7 : isCM MixedTree

o7 = false

See also

• isSCM -- determines if a (hyper)graph is sequentially Cohen-Macaulay
• edgeIdeal -- creates the edge ideal of a (hyper)graph