Abstract
By analogy with recent Work of Andrews on smallest parts in partitions of integers, we consider smallest parts in compositions (ordered partitions) of integers. In particular, we study the number of smallest parts and the sum of smallest parts in compositions of n as well as the position of the first smallest part in a random composition of n.
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.
