Macaulay2 » Documentation
Packages » ThinSincereQuivers » stableTrees
next | previous | forward | backward | up | index | toc

stableTrees -- return the spanning trees that are stable

Description

This routine returns the set of spanning trees of the quiver Q that are stable with respect to the provided weight th.

i1 : Q = bipartiteQuiver(2, 3);
i2 : th = {-3,-3,2,2,2};
i3 : stableTrees(th, Q)

o3 = {{0, 2, 4, 5}, {0, 1, 4, 5}, {1, 2, 3, 5}, {0, 1, 3, 5}, {1, 2, 3, 4},
     ------------------------------------------------------------------------
     {0, 2, 3, 4}}

o3 : List

For the programmer

The object stableTrees is a function closure.


The source of this document is in ThinSincereQuivers.m2:3279:0.