From a polynomial Riemann hypothesis to alternating sign matrices (Q5948491)

The authors start their study from a family of polynomials obtained as a result of a polynomial transform (called T-transform). These polynomials satisfy a Riemann hypothesis and a 4-term recursion. The attempts of the authors to simplify the recursion and to see the asymptotic behavior of the polynomials lead them to a new family of polynomials satisfying a 4-term recursion \(q_n(x)=x q_{n-1}(x)-C q_{n-2}(x)- q_{n-3}(x), \quad q_{-2}=q_{-1}=0,\;q_0=1\) and having real zeros with interleaving property the zeros of \(q_{n+1}\) interlace these of \(q_n\). The further considerations open up unexpected connections to various combinatorial objects such as alternating sign matrices, Hankel determinants as well as Macdonald-type integrals.