Underdiagonal lattice paths with unrestricted steps
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 572073 (Why is no real title available?)
- scientific article; zbMATH DE number 733222 (Why is no real title available?)
- scientific article; zbMATH DE number 3219117 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- Asymptotic Methods in Enumeration
- Formal languages and enumeration
- Functional Composition Patterns and Power Series Reversion
- Lattice path enumeration by formal schema
- On Some Alternative Characterizations of Riordan Arrays
- On context-free languages and push-down automata
- Riordan arrays and combinatorial sums
Cited in
(24)- Exhaustive generation of some lattice paths and their prefixes
- Generalized Schröder matrix and its combinatorial interpretation
- Proper generating trees and their internal path length
- Counting lattice paths taking steps in infinitely many directions under special access restrictions
- A generalization of the \(k\)-bonacci sequence from Riordan arrays
- The random generation of underdiagonal walks
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
- Ultrametrics, Banach's fixed point theorem and the Riordan group
- Combinatorial interpretation of generalized Pell numbers
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- Riordan arrays and difference equations of subdiagonal lattice paths
- scientific article; zbMATH DE number 2076939 (Why is no real title available?)
- Difference Equations and Generating Functions for some Lattice Path Problems
- Binary words excluding a pattern and proper Riordan arrays
- Further results on paths in an \(n\)-dimensional cubic lattice
- Enumerating several aspects of non-decreasing Dyck paths
- Some matrix identities on colored Motzkin paths
- Combinatorial matrices derived from generalized Motzkin paths
- Basic analytic combinatorics of directed lattice paths
- Enumerating restricted Dyck paths with context free grammars
- A Chung-Feller property for the generalized Schröder paths
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- scientific article; zbMATH DE number 2230292 (Why is no real title available?)
- Walks confined in a quadrant are not always D-finite
This page was built for publication: Underdiagonal lattice paths with unrestricted steps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283795)
