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

sumTwoMonomials -- tally the sequences of BRanks for certain examples

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
 -- setting random seed to 0

o1 = 0
i2 : sumTwoMonomials(2,3)
 -- used 1.7299s (cpu); 0.541286s (thread); 0s (gc)
 -- used 0.471005s (cpu); 0.131845s (thread); 0s (gc)
 -- used 0.000157483s (cpu); 2.375e-06s (thread); 0s (gc)
2
Tally{{{2, 2}, {1, 2}} => 3}

3
Tally{{{2, 2}, {1, 2}} => 1}

4
Tally{}

See also

Ways to use sumTwoMonomials:

  • sumTwoMonomials(ZZ,ZZ)

For the programmer

The object sumTwoMonomials is a method function.


The source of this document is in CompleteIntersectionResolutions.m2:4512:0.