get_multiplicity

the size of the largest (and also first) part

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

count

boolean if TRUE then compiled c code is
  used

use_c

boolean, if TRUE then a hash table is
  used

use_hash


  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


Provides algorithims for randomly sampling a feasible set defined
by a given total and number of elements using integer partitioning.

Daniel McGlinn

rpartitions

Code for integer partitioning

get_multiplicity function

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

get_multiplicity: 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

Description

Usage

Arguments

Examples