Counting paths in corridors using circular Pascal arrays

DOI10.1016/J.DISC.2014.05.020zbMATH Open1298.05014arXiv1407.2197OpenAlexW2039128157MaRDI QIDQ400362FDOQ400362

Authors: Shaun V. Ault, Charles Kicey 

Publication date: 21 August 2014

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

Abstract: A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain lattice paths within corridors, which are related to Dyck paths. This link provides new, short proofs of some nontrivial formulas found in the lattice-path literature.

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

Recommendations

• Riordan arrays and Pell numbers
• Pascal rhombus and Riordan array
• A matrix approach to generalized Delannoy and Schröder arrays
• The Pascal rhombus and Riordan arrays
• scientific article; zbMATH DE number 7234918

zbMATH Keywords

binomial coefficientlattice pathcorridor pathdiscrete linear operator

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Wavelets and filter banks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ballot problems

Cited In (3)

• Lattice paths in corridors and cyclic corridors
• Combinatorics on bounded free Motzkin paths and its applications
• Between Broadway and the Hudson: A Bijection of Corridor Paths

Uses Software

• OEIS

This page was built for publication: Counting paths in corridors using circular Pascal arrays

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