Abstract
A composition of the positive integer n is a representation of n as an ordered sum of positive integers n = a1 + a2 + … + am. It is well known that there are 2 n −1 compositions of n. An inversion in a composition is a pair of summands {ai,aj } for which i < j and a i > aj . The number of inversions of a composition is an indication of how far the composition is from a partition of n, which by convention uses a sequence of nondecreasing summands and has no inversions. We consider counting techniques for determining both the number of inversions in the set of compositions of n and the number of compositions of n with a given number of inversions. We provide explicit bijections to resolve several conjectures, and also consider asymptotic results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
