Sankar's three-dimensional Catalan formula for reduced valid hook configurations

At least 5 years old · documented by

Let RedVHC⁡k(Av⁡3k−i(312))\operatorname{RedVHC}_k(\operatorname{Av}_{3k-i}(312)) denote the set of 312312-avoiding reduced valid hook configurations with kk hooks on permutations with 2k+i2k+i points. Define

fk(x)=∑i=0k−1∣RedVHC⁡k(Av⁡3k−i(312))∣xi,f_k(x)=\sum_{i=0}^{k-1}\left|\operatorname{RedVHC}_k(\operatorname{Av}_{3k-i}(312))\right|x^i,

and let hk(x)=fk(x−1)h_k(x)=f_k(x-1). Sankar's conjecture. For all k≥1k\geq 1,

fk(0)=hk(1)=∣RedVHC⁡k(Av⁡3k(312))∣=2(3k)!k!(k+1)!(k+2)!.f_k(0)=h_k(1)=\left|\operatorname{RedVHC}_k(\operatorname{Av}_{3k}(312))\right|=2\frac{(3k)!}{k!(k+1)!(k+2)!}.

The right-hand side is the kkth three-dimensional Catalan number; the source presents this as one of Sankar's conjectures about these counting polynomials, and the supplied material gives no resolution status.

References

Primary source

Ilani Axelrod-Freed, “312-Avoiding Reduced Valid Hook Configurations and Duck Words”, arXiv:2010.11834 (2020).

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.