Abstract
We study unfair permutations, which are generated by letting n players draw numbers and assuming that player i draws i times from the unit interval and records her largest value. This model is natural in the context of partitions: the score of the ith player corresponds to the multiplicity of the summand i in a random partition, with the roles of minimum and maximum interchanged. We study the distribution of several parameters, namely the position of player i, the number of inversions, and the number of ascents. To perform some of the heavy computations, we use the computer algebra package Sigma.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.