Underdiagonal lattice paths with unrestricted steps

DOI10.1016/S0166-218X(98)00126-7zbMath0923.05003MaRDI QIDQ1283795

K. Appert

Publication date: 28 October 1999

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

zbMATH Keywords

generating functionDyck pathsunderdiagonal paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (20)

Walks confined in a quadrant are not always D-finite ⋮ Unnamed Item ⋮ Counting lattice paths taking steps in infinitely many directions under special access restrictions ⋮ Binary words excluding a pattern and proper Riordan arrays ⋮ Some matrix identities on colored Motzkin paths ⋮ Riordan arrays and difference equations of subdiagonal lattice paths ⋮ From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns ⋮ Generalized Schröder matrix and its combinatorial interpretation ⋮ Ultrametrics, Banach's fixed point theorem and the Riordan group ⋮ Combinatorial matrices derived from generalized Motzkin paths ⋮ Proper generating trees and their internal path length ⋮ A generalization of the \(k\)-bonacci sequence from Riordan arrays ⋮ Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata ⋮ A Chung-Feller property for the generalized Schröder paths ⋮ Unnamed Item ⋮ Enumerating several aspects of non-decreasing Dyck paths ⋮ The relevant prefixes of coloured Motzkin walks: an average case analysis ⋮ Difference Equations and Generating Functions for some Lattice Path Problems ⋮ Unnamed Item ⋮ Basic analytic combinatorics of directed lattice paths

Cites Work

• Lattice path enumeration by formal schema
• Formal languages and enumeration
• Riordan arrays and combinatorial sums
• Asymptotic Methods in Enumeration
• On Some Alternative Characterizations of Riordan Arrays
• Functional Composition Patterns and Power Series Reversion
• On context-free languages and push-down automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Underdiagonal lattice paths with unrestricted steps