partitionell

Partitionell is a concept in combinatorics describing a family of restricted integer partitions parameterized by an integer ell ≥ 1. An ell-partition of n is a partition n = a1 + a2 + ... + ak with a1 ≥ a2 ≥ ... ≥ ak > 0 and a_i - a_{i+1} ≥ ell for all i, where a_{k+1} is taken as 0 for the last term. The partitionell function p_ell(n) denotes the number of ell-partitions of n. The case ell = 1 corresponds to partitions into distinct parts.

For example, for n = 5, p_1(5) = 3 with the distinct-part partitions 5; 4 + 1; 3 + 2. For ell = 2, the ell-partitions of 5 are 5 and 4 + 1, so p_2(5) = 2. These examples illustrate how the constraint ell governs the allowed gaps between parts.

Generating function and methods: The ordinary generating function F_ell(q) = sum_{n≥0} p_ell(n) q^n can be obtained by standard q-series techniques. In practice, F_ell(q) is expressed as a specialized product or restricted sum that encodes the ell-step gap condition via Ferrers diagrams or equivalent combinatorial constructions.

Relation and scope: Partitionell lies within the study of restricted partitions and connects to various q-series identities and bijective techniques. It serves as a framework for exploring how fixing a minimum gap between parts changes counting, asymptotics, and potential congruence properties. See also partitions, restricted partitions, and Ferrers diagrams.