Random Generation of $k$-coloured Motzkin Paths
The study investigates k-coloured Motzkin paths and their connection with prefixes ending at odd height from both analytical and combinatorial perspectives.
This paper provides a new perspective on k-coloured Motzkin paths and their connection to prefixes ending at odd height, which is distinct from previous work.
Before reading this…
To understand this paper, make sure you know these concepts first:
- Motzkin pathsfind papers →
- combinatorial mathematicsfind papers →
Abstract
More Like ThisWe study k-coloured Motzkin paths, namely Motzkin paths in which horizontal steps can be coloured in k different ways, and investigate their connection with the number of prefixes ending at odd height from both an analytical and a combinatorial point of view. Moreover, the combinatorial approach provides a random generation algorithm for k-coloured Motzkin paths in linear-time.