The DWBC3 domino-tiling conjecture for the 20V model

About 7 years old · traced to

Let BnB_n be the sequence associated with 20V configurations with DWBC3 boundary conditions, and let bn=T(Tn)b_n=T({\mathcal T}_n) denote the number of domino tilings of the triangle Tn{\mathcal T}_n. The DWBC3 conjecture. The number of configurations of the 20V model with DWBC3 boundary conditions on an n×nn\times n square grid is equal to the number of domino tilings of Tn{\mathcal T}_n:

Bn=bn=T(Tn).B_n=b_n=T({\mathcal T}_n).

The conjecture is motivated by agreement of the initial values of the two sequences and would identify the 20V-DWBC3 enumeration with a domino-tiling enumeration; no proof or disproof is supplied here.

References

Primary source

Philippe Di Francesco and Emmanuel Guitter, “Twenty-Vertex model with domain wall boundaries and domino tilings”, arXiv:1905.12387 (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.