Home | Trees | Index | Help |
|
---|
Package young :: Module partition |
|
Classes | |
---|---|
Partition |
class for partition |
SeqOfPartition |
class for generating partitions |
Function Summary | |
---|---|
number_of_partition(n [,k]) -> Return the number of partitions of n. | |
partition(n) -> Return the partitions of n. | |
Ramanujan's upper bound for number of partitions of n | |
Tests whether or not the number is equal to or greater than any number of the partition. | |
Down operation of diagram | |
Up operation of diagram | |
Return the number of partitions of n with exactly k parts. | |
Return the partitions of n as a generator. |
Function Details |
---|
number_of_partition(number, k=None)number_of_partition(n [,k]) -> Return the number of partitions of n. If k is specified, return the number of partitions of n with k parts. |
partition(number)partition(n) -> Return the partitions of n. |
partition_upper_bound(n)Ramanujan's upper bound for number of partitions of n |
_compare_max_num(number, part)Tests whether or not the number is equal to or greater than any number of the partition. |
_down(shape)Down operation of diagram |
_up(shape)Up operation of diagram |
partition_with_k_parts(n, k)Return the number of partitions of n with exactly k parts. |
partitions(n)Return the partitions of n as a generator. |
Home | Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Wed Dec 08 22:20:20 2004 | http://epydoc.sf.net |