A (conjectural) 1/3-phenomenon for the number of rhombus tilings of a hexagon which contain a fixed rhombus (Q4407935)

The author deals with the problem of enumerating rhombus tilings of a hexagon which contain an arbitrary fixed rhombus. He makes the conjecture that the probability that a random rhombus tiling of a hexagon with side lengths \(2n+a\), \(2n+b\), \(2n+c\), \(2n+a\), \(2n+b\), \(2n+c\) contains the horizontal rhombus with coordinates \((2n+x, 2n+y)\) is equal to \[ \frac{1}{3}+f_{a,b,c,x,y}(n){2n\choose n}^3\bigg/{6n+2\choose 3n+1} \] for \(n>n_0=n_0(a,b,c,x,y)\) where \(f_{a,b,c,x,y}\) is a rational function in \(n\). Given that this is true, it is shown for specific values of \(a,b,c,x,y\) how to generate automatically a formula for \(f_{a,b,c,x,y}\) by use of computer algebra programs. Moreover, it is discussed how to establish the conjecture in these special cases completely automatically by available multisum algorithms. For the entire collection see [Zbl 0997.00018].