Using Symbolic Computation to Explore Generalized Dyck Paths and Their Areas

arXiv2305.09030MaRDI QIDQ6436733FDOQ6436733

Authors: Aj Bu, Doron Zeilberger 

Publication date: 15 May 2023

Abstract: We show the power of Bruno Buchberger's seminal Groebner Basis algorithm, interfaced, seamlessly, with what we call symbolic dynamical programming, to automatically generate algebraic equations satisfied by the generating functions enumerating so-called Generalized Dyck Walks, i.e. 2D walks that start and end on the x-axis, and never dip below it, for an arbitrary set of steps. More impressively, we combine it with calculus (that Maple knows very well!), to automatically compute generating functions for the sum-of-the-areas of these generalized Dyck paths, and even for the sum of any given power of the areas, enabling us to get statistical information about the area under a random generalized Dyck path.

This page was built for publication: Using Symbolic Computation to Explore Generalized Dyck Paths and Their Areas

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