On the generating functions of pattern-avoiding Motzkin paths

From MaRDI portal
Revision as of 23:06, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2133921

DOI10.1016/J.JSC.2022.02.006zbMATH Open1487.05020arXiv2108.03037OpenAlexW4214829125WikidataQ113869804 ScholiaQ113869804MaRDI QIDQ2133921FDOQ2133921

Antonio Bernini, Christian Bean, L. Ferrari, Matteo Cervetti

Publication date: 5 May 2022

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over x and the Catalan generating function C(x)=frac1sqrt14x22x2, where x keeps track of the length of the path. Moreover, an algorithm is provided for finding the generating function in the more general case of an arbitrary set of patterns. In addition, this algorithm allows us to find a combinatorial specification for pattern-avoiding Motzkin paths, which can be used not only for enumeration, but also for exhaustive and random generation.


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





Cites Work


Cited In (6)

Uses Software






This page was built for publication: On the generating functions of pattern-avoiding Motzkin paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133921)