Variations on a generating-function theme: enumerating compositions with parts avoiding an arithmetic sequence
From MaRDI portal
Abstract: A Def{composition} of a positive integer is a -tuple such that . Our goal is to enumerate those compositions whose parts avoid a fixed arithmetic sequence. When this sequence is given by the even integers (i.e., all parts of the compositions must be odd), it is well known that the number of compositions is given by the Fibonacci sequence. A much more recent theorem says that when the parts are required to avoid all multiples of a given integer , the resulting compositions are counted by a sequence given by a Fibonacci-type recursion of depth . We extend this result to arbitrary arithmetic sequences. Our main tool is a lemma on generating functions which is no secret among experts but deserves to be more widely known.
Recommendations
Cited in
(7)- A complete categorization of when generalized Tribonacci sequences can be avoided by additive partitions
- Cyclic compositions of a positive integer with parts avoiding an arithmetic sequence
- scientific article; zbMATH DE number 637319 (Why is no real title available?)
- The algebraic structure of the non-commutative nonlinear Schrödinger and modified Korteweg-de Vries hierarchy
- Arndt compositions: a generating functions approach
- The distribution of run lengths in integer compositions
- Allowing or prohibiting two consecutive colors in n-color compositions
This page was built for publication: Variations on a generating-function theme: enumerating compositions with parts avoiding an arithmetic sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450372)