Counting paths in corridors using circular Pascal arrays

DOI10.1016/j.disc.2014.05.020zbMath1298.05014arXiv1407.2197OpenAlexW2039128157MaRDI QIDQ400362

Shaun V. Ault, Charles Kicey

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

binomial coefficientlattice pathcorridor pathdiscrete linear operator

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65)

Related Items

Between Broadway and the Hudson: A Bijection of Corridor Paths ⋮ Combinatorics on bounded free Motzkin paths and its applications

Uses Software

• OEIS

Cites Work

• Ballot problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item