Counting nonintersecting lattice paths with turns
From MaRDI portal
Recommendations
- A remarkable formula for counting nonintersecting lattice paths in a ladder with respect to turns
- scientific article; zbMATH DE number 1058046
- Counting pairs of nonintersecting lattice paths with respect to weighted turns
- Nonintersecting paths, pfaffians, and plane partitions
- Counting of paths and coefficients of the Hilbert polynomial of a determinantal ideal
Cited in
(12)- Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application
- Counting pairs of lattice paths by intersections
- Counting pairs of nonintersecting lattice paths with respect to weighted turns
- Young bitableaux, lattice paths and Hilbert functions
- The \(h\)-vector of a ladder determinantal ring cogenerated by \(2\times 2\) minors is log-concave
- On multiplicities of points on Schubert varieties in Grassmannians. II
- scientific article; zbMATH DE number 426352 (Why is no real title available?)
- A remarkable formula for counting nonintersecting lattice paths in a ladder with respect to turns
- scientific article; zbMATH DE number 1058046 (Why is no real title available?)
- On the Number of Turns in Reduced Random Lattice Paths
- Counting lattice paths by crossings and major index. II: Tracking descents via two-rowed arrays
- A history and a survey of lattice path enumeration
This page was built for publication: Counting nonintersecting lattice paths with turns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921467)