Counting paths in corridors using circular Pascal arrays
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3681764 (Why is no real title available?)
- scientific article; zbMATH DE number 3712896 (Why is no real title available?)
- scientific article; zbMATH DE number 1242264 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Ballot problems
- Wavelets and filter banks
Cited in
(3)
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)