Gap-Free Compositions

• Gap-free compositions are sequences of positive integers summing to n where adjacent parts differ by at most one, ensuring a consecutive interval of part sizes.
• They are characterized by an explicit generating function, G(x) = (1+x)/(1-2x²-2x³), and a recurrence relation that reveals detailed combinatorial structure.
• This topic connects lattice path models and matrix reciprocity, providing foundational insights for bijective methods and probabilistic analysis in combinatorics.

A gap-free composition of a positive integer $n$ is a sequence of positive integers $(c_1,\ldots,c_t)$ such that $c_1+\cdots+c_t=n$ and $|c_{i+1}-c_i|\leq 1$ for all $1\leq i<t$. Equivalently, a composition is gap-free if the multiset of its part sizes forms a consecutive interval $\{1,2,\ldots,m\}$ for some $m$ and every two adjacent parts differ by at most one. Gap-free compositions provide a natural intersection of the study of locally restricted compositions, lattice path models, and reciprocity in combinatorial matrix identities.

1. Formal Definitions and Initial Properties

Given a nonnegative integer $k$, a composition $K=(K_1,\ldots,K_\ell)$ of $n$ is said to have gap-bound $k$ if $|K_{i+1}-K_i|\leq k$ for all $1\leq i<\ell$. The case $k=1$ is designated as gap-free: every pair of consecutive parts differs by at most one. The set of all gap-free compositions of $n$ is denoted by $\CA_{\leq 1}(n)$ or, equivalently, counted as $a_n=|\CA_{\leq 1}(n)|$ (Hopkins et al., 13 Dec 2025).

Small examples illustrate the structure. For $n=4$:

• $4$
• $3+1$, $2+2$, $1+3$
• $3+1+1$, $2+2+1$, $1+2+2$, $2+1+1$, $1+2+1$, $1+1+3$
• Combinations such as $3+1+1+1$, $2+1+1+1$, and so on

The “gap-free” constraint aligns with a local restriction in the sense of Bender, Canfield, and Gao: if $c=(c_1,\ldots,c_t)$ is gap-free, then $|c_{i+1}-c_i|\leq 1$ for all $i$. This property allows the combinatorial class to be embedded within the larger theory of locally restricted and asymptotically free compositions (Bender et al., 2012).

2. Generating Functions and Recurrence Relations

Gap-free compositions admit an explicit generating function and linear recurrence. The ordinary generating function is

$$G(x) = \sum_{n\geq 0} a_n\,x^n = \frac{1+x}{1-2x^2-2x^3}$$

which can also be written as

$G(x) = \frac{1-x^2}{1-x-2x^2+2x^4}$

(Hopkins et al., 13 Dec 2025). The sequence $\{a_n\}$ satisfies the recurrence

$$a_0=1,\quad a_1=1,\quad a_2=2;\qquad a_n=2a_{n-2}+2a_{n-3}\ \text{for}\ n\geq 3$$

The generating function can be motivated combinatorially by splitting compositions with respect to the parity of their length, analyzing adjacent pairs, and summing over patterns allowed by the gap-free condition. In particular, the structure can be built from atomic pairs $(j,j)$ and $(j,j+1)$, extended by repeated concatenation and completed by possible odd-length extensions (Hopkins et al., 13 Dec 2025).

For bivariate enumeration counting both parts and total sum, the generating function is rational in both variables: $G_1(x,q) = 1 + \frac{xq}{1 - x(1+q+q^2)}$ where the coefficient of $x^m q^n$ gives the number of gap-free compositions of $n$ with $m$ parts. The denominator reflects possible adjustments to adjacent part sizes (steps of $0,\pm1$) (Beck et al., 2021).

3. Matrix Reciprocity and Combinatorial Involution

A foundational property of gap-free compositions is their appearance in a two-matrix inversion identity analogous to the Beck–Chern reciprocity for partitions and minimum-gaps (Beck et al., 2021). Define two infinite lower-triangular matrices:

• $P^{(1)}_{i,j} = (-1)^{i-j} \cdot$ [q-binomial-like polynomial], interpreted as (signed) partition-type coefficients,
• $Y^{(1)}_{i,j} = C_1(i-j,j)$, the number of gap-free compositions of $i-j$ into $j$ parts.

These matrices satisfy

$P^{(1)} \cdot Y^{(1)} = I = Y^{(1)} \cdot P^{(1)}$

where $I$ is the identity matrix. The proof employs an involution pairing between signed partitions and gap-free compositions, canceling contributions except for a unique diagonal fixed point $(\emptyset,\emptyset)$. This involution corresponds to a stepwise decomposition: either move a part from the partition to the composition or vice versa within permitted constraints (Beck et al., 2021). This reciprocal structure elucidates the relationship between combinatorial and algebraic generating function techniques.

4. Asymptotics and Local Structure

The exponential growth rate of gap-free compositions is determined by the smallest positive real root $\rho$ of the equation

$1-2\rho^2-2\rho^3=0$

which evaluates numerically as $\rho \approx 0.5550$, so $a_n\sim C \cdot \rho^{-n}$ for some $C>0$ (Hopkins et al., 13 Dec 2025). Standard singularity analysis applies via the location of this dominant singularity in the generating function.

Adopting the framework of locally restricted, asymptotically free compositions, random gap-free compositions display further structure:

• The mean largest part $E[M_n]$ in a random gap-free composition of $n$ is $\log_{1/r} n + O(1)$, with precise corrections available via Mellin transform techniques.
• The expected number of distinct recurrent parts similarly grows as $\log_{1/r} n + O(1)$
• For fixed $k$, the expected number of distinct recurrent parts of multiplicity $k$ remains bounded as $n\to\infty$

The fine enumerative structure is governed by asymptotic normality for small part counts and asymptotic geometric or Poisson behavior for large parts, allowing Poisson approximation methods for gap-freeness probabilities (Bender et al., 2012).

5. Probability of Gap-Freeness and Random Sampling

For a general recurrent, asymptotically free class $\mathcal{C}$, the probability $q_n$ that a random composition of $n$ is gap-free can be expressed as

$$q_n = \sum_k \exp(-C n r^{k+1}) \prod_{j=1}^k (1 - \exp(-C n r^j)) + o(1)$$

where $r\in (0,1)$ and $C > 0$ depend on the combinatorial specification (Bender et al., 2012). The product form mirrors occupancy probabilities: a composition is gap-free if for each $1\leq j\leq k$, there is at least one part of size $j$. This is structurally analogous to the problem of a random sample from a geometric distribution omitting no elements of an initial segment.

This characterization enables the calculation of limiting distributions for maximal part size, number of distinct parts, and multiplicity counts, as well as explicit error bounds. For large $n$, the bulk of the gap-freeness probability is concentrated near $k\approx\log_{1/r} n$.

6. Connections to Carlitz–Arndt Compositions and Generalizations

Gap-free compositions are a central case in the broader “Carlitz–Arndt” class, in which the local constraint $|c_{2i-1}-c_{2i}|\leq k$ is imposed for some $k\geq 1$. The combinatorial and generating-function machinery specializes at $k=1$ to recover all classical gap-free results:

• Recurrence $a_n=2a_{n-2}+2a_{n-3}$
• Ordinary generating function $G(x) = \frac{1+x}{1-2x^2-2x^3}$
• Bijections to subclasses $Q_{\leq 1}$ (Hopkins et al., 13 Dec 2025)

Moreover, the Carlitz–Arndt framework facilitates extensions, such as colored parts, refined congruence constraints, and the connection to Rogers–Ramanujan-type partition identities. In particular, this setting clarifies the relationship between previously scattered enumeration results and opens structural interpretations for observed factorizations in generating functions.

7. Research Directions and Broader Context

Gap-free compositions continue to serve as a test case for new bijective methods, analytic combinatorics of locally restricted objects, and the development of matrix reciprocity. The link to asymptotically free local restrictions underpins a rich probabilistic and enumerative theory, informing studies of generalized pattern avoidance, universality of part-size statistics, and connections with lattice path enumerations.

These results have provided a laboratory for exploring the enumeration and random sampling of compositions under local conditions, setting the stage for research on more intricate local constraints and their impact on combinatorial structure and asymptotic behavior (Beck et al., 2021, Bender et al., 2012, Hopkins et al., 13 Dec 2025).