Enumeration of ukasiewicz paths modulo some patterns
Abstract
For any pattern α of length at most two, we enumerate equivalence classes of ukasiewicz paths of length n≥ 0 where two paths are equivalent whenever the occurrence positions of α are identical on these paths. As a byproduct, we give a constructive bijection between Motzkin paths and some equivalence classes of ukasiewicz paths.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.