Elliptic enumeration of nonintersecting lattice paths (Q878955): Difference between revisions

The paper enumerates lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. The elliptic generating function of paths from a given starting point to a given ending point generalizes the binomial coefficient and the \(q\)-binomial coefficient. Convolution results in an identity equivalent to Frenkel and Turaev's \(_{10}V_9\) summation, giving its first combinatorial proof. The consideration of nonintersecting lattice paths leads to a multivariate extension of the \(_{10}V_9\) summation, which is a special case of an identity conjectured by Warnaar, and proved by Rosengren.