Pages that link to "Item:Q1283795"

The following pages link to Underdiagonal lattice paths with unrestricted steps (Q1283795):

Displaying 22 items.

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