Alternating-sum Catalan conjecture for reduced valid hook configurations

About 7 years old · traced to

For k≥1k\geq 1, let Ck=1k+1(2kk)C_k=\frac{1}{k+1}{2k\choose k} be the kkth Catalan number, and let RedVHC⁡k(Av⁡n(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 k≥1k\geq 1,

∑i=1k(−1)k−i∣RedVHC⁡k(Av⁡2k+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.

References

Primary source

Maya Sankar, “Further Bijections to Pattern-Avoiding Valid Hook Configurations”, arXiv:1910.08895 (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.