kStatistics (version 1.0)

mkmSet: Subdivisions of a Multiset

Description

Generate all the subdivisions of a multiset, reducing the overall computational complexity using integer partitions

Usage

mkmSet(vPar)

Arguments

vPar

Number of blocks to consider or array of numbers of blocks to consider

Value

list

two-dimensional list: in the first there is the partition type, while in the second there is its multiplicity

References

Di Nardo E., G. Guarino and D. Senato (2008) An unifying framework for k-statistics, polykays and their generalizations. Bernoulli. Vol. 14(2), 440-468. Official Journal of the Bernoulli Society for Mathematical Statistics and Probability, http://isi.cbs.nl/bernoulli/, (download from http://www.elviradinardo.it/lavori1.html)

See Also

umSet, mCoeff, countP, nStirling2, intPart, df

Examples

# NOT RUN {
mkmSet(3)
# generates [ [[1,1,1],1], [[1,2],3], [[3],1]  ]
# The support of the muliset has all the same eleents

mkmSet(c(2,1)) 
# generates [ [[1,1],[1,0],2], [[1,0],[1,0],[0,1],1],[[2,0],[0,1],1], [[2,1],1] ]
# The support of the multiset has 2 elements with instances respectively 2 and 1.

# }