Florek Wojciech
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.
Poznań
OWN
artykuł
application/pdf
eng
Nie masz uprawnień do wyświetlenia tego obiektu. Aby poprosić o dostęp do niego, wypełnij poniższe pola.