arXiv Analytics

Sign in

arXiv:1808.08906 [math.CO]AbstractReferencesReviewsResources

Statistics on Multisets

Shashikant Mulay, Carl Wagner

Published 2018-08-27Version 1

We offer a new proof that a certain q-analogue of multinomial coeffi- cients furnishes a q-counting of the set of permutations of an associated multiset of positive integers, according to the number of inversions in such arrangements. Our proof uses the fact that such q-multinomial coefficients enumerate certain classes of chains of subspaces of a fnite dimensional vector space over a fnite field of cardinality q. Additionally, we investigate the function that counts the number of permutations of a multiset having a fixed number of inversions.

Related articles: Most relevant | Search more
arXiv:0909.2274 [math.CO] (Published 2009-09-11)
The number of permutations realized by a shift
arXiv:0904.2792 [math.CO] (Published 2009-04-17)
The largest and the smallest fixed points of permutations
arXiv:1303.3776 [math.CO] (Published 2013-03-15, updated 2015-06-05)
Factorization of permutations