The vectorial kernel method for walks with longer steps

From MaRDI portal
Publication:5089991

DOI10.2989/16073606.2021.1925367zbMATH Open1493.05024arXiv2008.02240OpenAlexW3167769630MaRDI QIDQ5089991FDOQ5089991


Authors: Valerie Roitner Edit this on Wikidata


Publication date: 15 July 2022

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Abstract: Asinowski, Bacher, Banderier and Gittenberger (A. Asinowski, A. Bacher, C. Banderier and B. Gittenberger. Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata. Algorithmica, pp. 1-43, 2019.) recently developed the vectorial kernel method - a powerful extension of the classical kernel method that can be used for paths that obey constraints that can be described by finite automata, e.g. avoid a fixed pattern, avoid several patterns at once, stay in a horizontal strip and many others more. However, they only considered walks with steps of length one. In this paper we will generalize their results to walks with longer steps. We will also give some applications of this extension and prove a conjecture about the asymptotic behavior of the expected number of ascents in Schroeder paths.


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




Recommendations




Cites Work






This page was built for publication: The vectorial kernel method for walks with longer steps

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