2000 character limit reached
Motzkin paths of bounded height with two forbidden contiguous subwords of length two (2310.12497v2)
Published 19 Oct 2023 in math.CO
Abstract: Motzkin excursions and meanders are revisited. This is considered in the context of forbidden patterns. Previous work by Asinowski, Banderier, Gittenberger, and Roitner is continued. Motzkin paths of bounded height are considered, leading to matrix equations and also to continued fractions. The enumeration is done by properly setting up bivariate generating functions which can be expanded using the kernel method.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.