Compositions colored by simplicial polytopic numbers
Daniel Birmajer, Juan B. Gil, Michael D. Weiner

TL;DR
This paper introduces a new class of colored compositions based on simplicial polytopic numbers, providing explicit enumeration formulas and bijections to other composition sets, generalizing previous color composition results.
Contribution
It generalizes existing results for color compositions by introducing compositions colored according to simplicial polytopic numbers and provides explicit formulas and bijections.
Findings
Derived explicit formulas for these generalized compositions.
Established bijections to compositions with restricted part sizes.
Extended known results from classical color compositions to a broader class.
Abstract
For a given integer , we consider -color compositions of a positive integer for which each part of size admits colors. We give explicit formulas for the enumeration of such compositions, generalizing existing results for -color compositions (case ) and -color compositions (case ). In addition, we give bijections from the set of -color compositions of to the set of compositions of having only parts of size and , the set of compositions of having only parts of size congruent to modulo , and the set of compositions of having no parts of size less than . Our results rely on basic properties of partial Bell polynomials and on a suitable adaptation of known bijections for -color compositions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
