Alternating-sum Catalan conjecture for reduced valid hook configurations

From papers

For k1k\geq 1, let Ck=1k+1(2kk)C_k=\frac{1}{k+1}{2k\choose k} be the kkth Catalan number, and let RedVHCk(Avn(312))\operatorname{RedVHC}_k(\operatorname{Av}_n(312)) be the reduced valid hook configurations with kk hooks on permutations avoiding 312312.

Alternating-sum Catalan conjecture. For every k1k\geq 1,

i=1k(1)kiRedVHCk(Av2k+i(312))=Ck.\sum_{i=1}^k(-1)^{k-i}\left|\operatorname{RedVHC}_k(\operatorname{Av}_{2k+i}(312))\right|=C_k.

The identity is one of the additional patterns suggested by the displayed coefficient triangle; the source gives no resolution status.

Progress summary

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

Sources & referencesView supporting material

Primary source

Maya Sankar, “Further Bijections to Pattern-Avoiding Valid Hook Configurations”, arXiv:1910.08895 (2019).

Solutions 0

No solutions have been posted yet.