← All problems

Amdeberhan's generating-function conjecture for the maximum number of 1-hooks

13 years old · documented by

Let P(n)P(n) denote the set of partitions of nn, and let α1(λ)\alpha_1(\lambda) be the number of 11-hooks in a partition λ\lambda, equivalently the number of distinct parts. Define

bn=max⁡{α1(λ) ⁣:λ∈P(n)}.b_n=\max\{\alpha_1(\lambda)\colon \lambda\in P(n)\}.

Write

(q;q)∞=(1−q)(1−q2)(1−q3)⋯ .(q;q)_\infty=(1-q)(1-q^2)(1-q^3)\cdots.

Amdeberhan's conjecture. The generating function for the sequence bnb_n is

∑n≥0bnqn=11−q((q2;q2)∞2(q;q)∞−1).\sum_{n\geq 0}b_nq^n=\frac{1}{1-q}\left(\frac{(q^2;q^2)_\infty^2}{(q;q)_\infty}-1\right).
References

Status

Source: Anna R. B. Fan, Harold R. L. Yang and Rebecca T. Yu, “On the Maximum Number of k-Hooks of Partitions of n”, arXiv:1212.3505 (2012).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.