Yields the d-th Macaulay representation of the integer a. Given a positive integer d, each positive integer a can be uniquely represented as a sum of binomials binomial(bd,d) + binomial(bd-1,d-1) + ... + binomial(b1,1), where bd > bd-1 > ... > b1 >= 0.
i1 : macaulayRep(100,4) o1 = {{8, 4}, {6, 3}, {5, 2}} o1 : List |
i2 : macaulayRep(10,5) o2 = {{6, 5}, {4, 4}, {3, 3}, {2, 2}, {1, 1}} o2 : List |