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.





Describes a project that uses

Uses Software





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)