|
rpartitions
● Data Source:
CranContrib
● Keywords:
● Alias: rpartitions, rpartitions-package
●
0 images
|
last
(Package: rpartitions) :
Returns the last element of a vector
Returns the last element of a vector
● Data Source:
CranContrib
● Keywords:
● Alias: last
●
0 images
|
P
(Package: rpartitions) :
Number of partitions of Q with k or less parts.
This function was derived using the following theorem and proposition. The number of partitions of Q with k or less parts equals the number of partitions of Q with k or less as the largest part (see Bona 2006). This is a mathematical symmetry, i.e. congruency. Additionally, the number of partitions of Q with k or less parts equals the number of partitions of Q+k with k as the largest part when k>0, i.e. P(Q + k, k). We do not have a source for this proposition, but it can be shown when enumerating the entire feasible set or using the Sage computing enviornment
● Data Source:
CranContrib
● Keywords:
● Alias: P
●
0 images
|
bottom_up
(Package: rpartitions) :
Bottom up method of generating uniform random partitions of Q having N parts.
Bottom up method of generating uniform random partitions of Q having N parts.
● Data Source:
CranContrib
● Keywords:
● Alias: bottom_up
●
0 images
|
top_down
(Package: rpartitions) :
Top down method of generating uniform random partitions of Q having N parts.
Top down method of generating uniform random partitions of Q having N parts.
● Data Source:
CranContrib
● Keywords:
● Alias: top_down
●
0 images
|
multiplicity
(Package: rpartitions) :
multiplicity method of generating uniform random partitions of Q having N
multiplicity method of generating uniform random partitions of Q having N parts.
● Data Source:
CranContrib
● Keywords:
● Alias: multiplicity
●
0 images
|
get_multiplicity
(Package: rpartitions) :
Find the number of times a value k occurs in a partition that is being
Find the number of times a value k occurs in a partition that is being generated at random by the multiplicity() function. The resulting multiplicity is then passed back to the multiplicity() function along with an updated value of count and an updated dictionary D
● Data Source:
CranContrib
● Keywords:
● Alias: get_multiplicity
●
0 images
|
divide_and_conquer
(Package: rpartitions) :
Divide and conquer method of generating uniform random partitions of Q
Divide and conquer method of generating uniform random partitions of Q having N parts.
● Data Source:
CranContrib
● Keywords:
● Alias: divide_and_conquer
●
0 images
|
NrParts
(Package: rpartitions) :
Find the number of partitions for a given total Q and number of parts N.
This function was recoded and modified from GAP source code: www.gap-system.org. Modifications for speed were based on the proposition that the number of partitions of Q having N parts is equal to the number of partitions of Q having N parts is equal to the number of partitions of Q - N, if N > Q/2 (for odd Q) or if N >= Q/2 (for even Q)
● Data Source:
CranContrib
● Keywords:
● Alias: NrParts
●
0 images
|
get_rand_int
(Package: rpartitions) :
Generate a random integer between two integers
Generate a random integer between two integers
● Data Source:
CranContrib
● Keywords:
● Alias: get_rand_int
●
0 images
|
providing 
.