rootCount -- counts the number of roots of a chordal network

Synopsis

Usage:

rootCount N
Inputs:
- N, an instance of the type ChordalNet,
Outputs:
- an integer, an upper bound on the number of isolated roots

Description

This method counts the number of points (including multiplicities) in the variety of a chordal network, in case such variety is finite. If the variety is positive dimensional, then the method returns an upper bound on the number of isolated points.

i1 : I = chromaticIdeal(QQ, cycleGraph 10, 2);

o1 : Ideal of QQ[a..j]

i2 : N = chordalNet I;

i3 : chordalTria N;

i4 : rootCount N

o4 = 2

Ways to use rootCount :

rootCount(ChordalNet)

For the programmer

The object rootCount is a method function.

rootCount -- counts the number of roots of a chordal network

Synopsis

Description

See also

Ways to use rootCount :

For the programmer