Macaulay2 » Documentation
Packages » TSpreadIdeals > solveBinomialExpansion

next | previous | forward | backward | up | index | toc

solveBinomialExpansion -- compute the sum of a binomial expansion

Synopsis

Usage:

solveBinomialExpansion l
Inputs:
- l, a list of pairs of integers representing a binomial expansion
Outputs:
- an integer, the sum of binomials in the listl

Description

Given a list of pairs $\{\{a_1,b_1\}, ... ,\{a_k,b_k\}\}$ this method yields the sum of binomials $\binom{a_1,b_1} + \cdots + \binom{a_k,b_k}.$

Example:

i1 : solveBinomialExpansion({{4,2},{3,1}})

o1 = 9

i2 : solveBinomialExpansion tMacaulayExpansion(50,12,2,1)

o2 = 50

See also

tMacaulayExpansion -- compute the t-Macaulay expansion of a positive integer

Ways to use solveBinomialExpansion :

solveBinomialExpansion(List)

For the programmer

The object solveBinomialExpansion is a method function.