2000 character limit reached
Arndt and Carlitz Compositions
Published 13 Dec 2025 in math.CO and math.NT | (2512.12354v1)
Abstract: Carlitz considered integer compositions in which adjacent parts must be unequal. Arndt recently initiated the study of restricted compositions based on conditions applied to certain pairs of parts rather than to individual parts. Here, we combine and generalize these notions, establishing enumeration results using both combinatorial proofs and generating functions. Motivations for our generalizations include the gap-free compositions studied by Hitczenko and Knopfmacher and the Rogers-Ramanujan integer partitions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.