arXiv Analytics

Sign in

arXiv:1812.11010 [math.CO]AbstractReferencesReviewsResources

Compositions with restricted parts

Jia Huang

Published 2018-12-28Version 1

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on partitions with restricted parts, which were confirmed analytically by Andrews and Chern and combinatorially by Yang. Analogous to Euler's partition theorem, it is known that the number of compositions of $n$ with odd parts equals the number of compositions of $n+1$ with parts greater than one. Extending a bijection due to Sills, we generalize this result similarly as Glaisher and Franklin generalized Euler's partition theorem. We prove, both analytically and combinatorially, two closed formulas for the number of compositions with restricted parts appearing in our generalization. We also obtain some composition analogues for the conjectures of Beck.

Related articles: Most relevant | Search more
arXiv:math/0603285 [math.CO] (Published 2006-03-13)
Enumeration of 3-letter patterns in compositions
arXiv:1507.01339 [math.CO] (Published 2015-07-06)
On the greatest and least elements in the set of semistandard tableaux of given shape and weight
arXiv:1301.4459 [math.CO] (Published 2013-01-18)
Composition of simplicial complexes, polytopes and multigraded Betti numbers