Macaulay2 » Documentation
Packages » RelativeCanonicalResolution :: balancedPartition

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

balancedPartition -- Computes balanced partition of n of length d

Synopsis

Usage:

e=balancedPartition(d,n)
Inputs:
- d, an integer, the length of the partition
- n, an integer, the natural number we want to partition
Outputs:
- e, a list, the balanced partition

Description

This function computes a balanced partition of an integer n of length d

i1 : (d,n) = (4,7);

i2 : e = balancedPartition(d,n)

o2 = {2, 2, 2, 1}

o2 : List

Ways to use balancedPartition :

balancedPartition(ZZ,ZZ)

For the programmer

The object balancedPartition is a method function.