Combinatorial reciprocity conjecture for the determinants Ds,t(n)D_{s,t}(n)

About 9 years old · traced to

Let Ds,t(n)D_{s,t}(n) denote the determinant associated with the corresponding family of cyclically symmetric rhombus-tiling regions, with the parity of s−ts-t distinguishing ordinary tiling counts from weighted counts. Combinatorial reciprocity conjecture. For integers n⩾r⩾1n\geqslant r\geqslant1,

D2r−1,0(2n+1)=D0,0(2n−2r+2)∣μ→1−μ−6n.D_{2r-1,0}(2n+1)=D_{0,0}(2n-2r+2)\big|_{\mu\to1-\mu-6n}.

This conjecture proposes a reciprocity between determinants that count cyclically symmetric rhombus tilings and determinants that perform weighted counts. For concrete integer parameters, one determinant may fall outside the stated combinatorial interpretation, for example when the hole is larger than the hexagon.

References

Primary source

Christoph Koutschan and Thotsaporn Thanatipanonda, “A Curious Family of Binomial Determinants That Count Rhombus Tilings of a Holey Hexagon”, arXiv:1709.02616 (2018).

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.