This material has been published in
the only definitive repository of the content that has been
certified and accepted after peer review. Copyright and all rights therein
are retained by Elsevier B.V.
This material may not be copied or reposted
without explicit permission.
Counting pairs of nonintersecting lattice paths with
respect to weighted turns
A formula involving a difference of the products of four q-binomial coefficients is shown to count pairs of nonintersecting lattice paths having a
prescribed number of weighted turns. The weights are assigned to account for the
location of the turns according to the
major and lesser indices.
The result, which is a q-analogue of a variant of the formula of Kreweras and
Poupard, is proved bijectively; however, when q=!=1
the bijection is defined inductively.
The following versions are available:
Back to Christian Krattenthaler's