Roots of Cluster Polynomial representation of n-ary patterns

The package provides methods for computing the roots of cluster polynomials

The definition of Cluster Polynomials was given in Tech. Report DEMO2011/1 available at

http://cag.dat.demokritos.gr/publications/TR2011-1.pdf

There are two versions.
binroots that was used to produce the images of the last four figures in the report above and a more advanced version that can be used for any base alphabet or symbolic sequence
The special routines BLLSG/NLLSG serve to produce all members of the power set that correspond to the paths of an binary/n-ary tree. Generally, BLLSG is faster for binary. Also, NLLSG may cause memory overflow for large bases in which case, it is better to split the whole set and examine it in parts. This requires a minimal intervention in polyroots.m code