Creator:

Florek Wojciech

Abstract:

Two combinatorial algorithms, generation of ordered partitions of N with no more than m parts and decompositions of N-element set into subsets with cardinalities given by a partition [k] = [k0 k1... km-1] are presented and their possible applications to finite (mesoscopic) spin systems are indicated. The flow charts, listings, and results of test runs are provided.

Place of publishing:

Poznań

Publisher:

OWN

Resource Type:

artykuł

Format:

application/pdf

Language:

eng