Shift => ..., default value false, optional argument for macaulayExpansion
Outputs:
a list, pairs of positive integers representing the i-th (shifted) Macaulay expansion of a
Description
Given a pair of positive integers (a,i) there is a unique expression of a as a sum of binomials a=binomial(a_i,i) + binomial(a_{i-1},i-1) + ... + binomial(a_j,j) where a_i > a_{i-1} > ... > a_j > j >= 1.