View source: R/partitionsNumber.R
sum_partitions.cardFixed | R Documentation |
sum_partitions.cardFixed
returns the sum on I subset of [1,p], |I|
fixed, of the sums computed by sum_prod.comb
.
sum_partitions.cardFixed(A, N, K, p, cardI)
A |
a matrix with p rows and K column. Each row contains the number of marked partition in 1<=k<=K groups for one of the p children of a given node. |
N |
a matrix with p rows and K column. Each row contains the number of partition in 1<=k<=K groups for one of the p children of a given node |
K |
an integer. The number of groups wanted. |
p |
an integer. The number of daughters of a node. |
cardI |
an integer. The cardinal of the subset wanted. |
This function uses combn
to enumerate all the subsets I of [1,p] of
a given cardinal, and then performs the wanted sum on these subsets.
double : the result of the sum.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.