Integer Partitions via Universal Lexicons

A new method for Integer Partitions in N Urns through Cluster Polynomials

2 DIRECTORIES:
- SMALLPART/
smallpart.m
clusterindex.m

- PARTITIONS/
partition.m
cluster.m
BLLSG.m

Both are based on the Cluster Polynomial Representation of binary words of arbitrary length. The theory of Universal Lexicons is covered in the following Technical Report (submitted in J. App. Comp. Math.)
http://cag.dat.demokritos.gr/publications/TR2011-1.pdf

smallpart.m is a method for small combinatoric groups based on the internal MATLAB function ff2n for lexicon matrices
It also uses a simpler function for cluster polynomial coefficients

partition.m is based on a Sequential Lexicon Line Generator (a simple addition automaton) for words of arbitrary length (up to 2^32 for ordinary installations)

The clusters.m is a more advanced version of clusterindex.m where use is made of a "reversing sequence" for automatic memory erasure which completely eliminates the use of if... else... structures