Counting lattice paths by crossings and major index I: the corner-flipping bijections

DOI10.5070/C62257880zbMath1498.05035arXiv2106.09878OpenAlexW3175958612MaRDI QIDQ5051366

Sergi Elizalde

Publication date: 23 November 2022

Published in: Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.09878

zbMATH Keywords

bijectionlattice pathmajor indexcrossingvalley

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points
• Mahonian pairs
• Enumeration of partitions with prescribed successive rank parity blocks
• The numbers of zeros and of changes of sign in a symmetric random walk
• Binomial determinants, paths, and hook length formulae
• q-Catalan numbers
• Walks, walls, wetting, and melting
• On lattice path counting by major index and descents
• Counting pairs of lattice paths by intersections
• Lattice Path Enumeration
• Ballot theorem and lattice path crossings
• The major counting of nonintersecting lattice paths and generating functions for tableaux
• On some problems concerning a restricted random walk
• On the Vector Representations of Induced Matroids