Description Usage Arguments Examples
multiplicity method of generating uniform random partitions of Q having N parts.
1 | multiplicity(part, Q, D, rand_int, use_c, use_hash)
|
part |
a vector to hold the partition |
Q |
the total sum of the partition |
D |
a dictionary for the number of partitions of Q having N or less parts (or N or less as the largest part), i.e. P(Q, Q + N). |
rand_int |
random integer |
use_c |
boolean if TRUE then compiled c code is used |
use_hash |
boolean, if TRUE then a hash table is used |
1 | multiplicity(c(5, 4), 4, hash(), 1, TRUE, FALSE)
|
Loading required package: hash
hash-3.0.1 provided by Decision Patterns
[1] 6 2 2 2 1
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.