Counting lattice paths by crossings and major index II: tracking descents via two-rowed arrays

arXiv2112.05696MaRDI QIDQ6385342FDOQ6385342

Authors: Sergi Elizalde 

Publication date: 10 December 2021

Abstract: We present refined enumeration formulas for lattice paths in $mathbb{Z}^2$ with two kinds of steps, by keeping track of the number of descents (i.e., turns in a given direction), the major index (i.e., the sum of the positions of the descents), and the number of crossings. One formula considers crossings between a path and a fixed line; the other considers crossings between two paths. Building on the first paper of the series, which used lattice path bijections to give the enumeration with respect to major index and crossings, we obtain a refinement that keeps track of the number of descents. The proof is based on new bijections which rely on certain two-rowed arrays that were introduced by Krattenthaler.

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) (q)-calculus and related topics (05A30)

This page was built for publication: Counting lattice paths by crossings and major index II: tracking descents via two-rowed arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6385342)