A binomial identity for valid compositions

Let nn and kk be nonnegative integers, and let CqC_q and DqD_q be the quantities defined in Theorem 8 for compositions qq. Write Compk+1(nk)\operatorname{Comp}_{k+1}(n-k) for the set of compositions of nkn-k with k+1k+1 parts. The binomial-sum conjecture. In the notation of Theorem 8,

qCompk+1(nk)CqDq=1n+1(nk1k)(2n2kn)\sum_{q\in\operatorname{Comp}_{k+1}(n-k)}C_qD_q=\frac{1}{n+1}{n-k-1\choose k}{2n-2k\choose n}

for all nonnegative integers nn and kk. Numerical evidence suggests this identity, which would give a term-by-term refinement of the generating-function identity obtained by combining Theorems 8 and 9.

Sources & referencesView supporting material

Primary source

Colin Defant, “Stack-Sorting Preimages of Permutation Classes”, arXiv:1809.03123 (2019).

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.