On the number of walks in a triangular domain

zbMath1308.05010arXiv1402.4448MaRDI QIDQ2263779

Paul R. G. Mortimer, Thomas Prellberg

Publication date: 19 March 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.4448

zbMATH Keywords

Ballot pathstwo-coloured Motzkin paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Paths and cycles (05C38)

Related Items (4)

Bijections between walks inside a triangular domain and Motzkin paths of bounded amplitude ⋮ Walks in simplices, cylindric tableaux, and asymmetric exclusion processes ⋮ Zero range process and multi-dimensional random walks ⋮ Continuous-time multidimensional walks as an integrable model

Cites Work

• Unnamed Item
• Unnamed Item
• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• A bijection between partially directed paths in the symmetric wedge and matchings
• Classifying lattice walks restricted to the quarter plane
• Combinatorial aspects of continued fractions
• Generating functions for generating trees
• Basic analytic combinatorics of directed lattice paths
• The kernel method: a collection of examples
• Skew-standard tableaux with three rows
• Partially directed paths in a wedge
• Walks with small steps in the quarter plane
• Random Walk in a Weyl Chamber
• Nestings of Matchings and Permutations and North Steps in PDSAWs
• A directed walk model of a long chain polymer in a slit with attractive walls

This page was built for publication: On the number of walks in a triangular domain