Macaulay2 » Documentation
Packages » CompleteIntersectionResolutions :: sumTwoMonomials
next | previous | forward | backward | up | index | toc

sumTwoMonomials -- tally the sequences of BRanks for certain examples

Synopsis

Description

tallies the sequences of B-ranks that occur for sums of pairs of monomials in R = S/(d-th powers of the variables), with full complexity (=c); that is, for an appropriate syzygy M of M0 = R/(m1+m2) where m1 and m2 are monomials of the same degree.

i1 : setRandomSeed 0

o1 = 0
i2 : sumTwoMonomials(2,3)
     -- used 0.289845 seconds
2
Tally{{{2, 2}, {1, 2}} => 3}

     -- used 0.0926882 seconds
3
Tally{{{2, 2}, {1, 2}} => 1}

     -- used 1.087e-6 seconds
4
Tally{}

See also

Ways to use sumTwoMonomials :

For the programmer

The object sumTwoMonomials is a method function.