Timeline for Combinations of multisets with finite multiplicities
Current License: CC BY-SA 2.5
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 15, 2015 at 17:27 | comment | added | მამუკა ჯიბლაძე | Related question here on MO with an answer by Richard Stanley | |
Aug 16, 2015 at 15:02 | answer | added | Chip Eastham | timeline score: 2 | |
Aug 1, 2010 at 8:20 | history | edited | Harun Šiljak | CC BY-SA 2.5 |
clearing up the statement
|
Jul 25, 2010 at 21:26 | comment | added | Harun Šiljak | @András: looking it right now - but I don't see how a formula for combinations I'm looking for could directly follow from a formula for partitions given there? | |
Jul 25, 2010 at 20:22 | comment | added | András Salamon | Have you looked at Knuth's Volume 4 fascicle 3, in particular exercise 39 in section 7.2.1.4? | |
Jul 25, 2010 at 16:59 | comment | added | Harun Šiljak | Oh, sorry for not making it clear: a $k$-combination means simply picking k terms from the multiset (order not important). $k$-permutation is basically the same, but order is important. In the example above, the multiset is $\{m_1\cdot a_1, m_2\cdot a_2,\ldots,m_n\cdot a_n\}$, $a_i$ being the elements, $m_i$ being the multiplicities. | |
Jul 25, 2010 at 16:39 | comment | added | Qiaochu Yuan | I am not sure I understand what a k-combination or a k-permutation is. | |
Jul 25, 2010 at 12:32 | history | asked | Harun Šiljak | CC BY-SA 2.5 |