Ferraris, S;
Mendelson, A;
Ballesio, G;
Vercauteren, T;
(2015)
Counting sub-multisets of fixed cardinality.
ArXiv
Preview |
Text
1511.06142v1.pdf - Published Version Download (133kB) | Preview |
Abstract
This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by sampling without replacement from a finite population partitioned into subsets, in the case where items belonging to the same subset are considered indistinguishable. Despite the generality of this problem, we have been unable to find this result published elsewhere.
| Type: | Working / discussion paper |
|---|---|
| Title: | Counting sub-multisets of fixed cardinality |
| Open access status: | An open access version is available from UCL Discovery |
| Publisher version: | http://arxiv.org/abs/1511.06142v1 |
| Language: | English |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Med Phys and Biomedical Eng |
| URI: | https://discovery.ucl.ac.uk/id/eprint/1496018 |
Archive Staff Only
 |
View Item |
