2000 character limit reached
Grand Dyck paths with air pockets
Published 9 Nov 2022 in math.CO and cs.DM | (2211.04914v1)
Abstract: Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck paths with air pockets by allowing them to go below the $x$-axis. We present enumerative results on GDAP (or their prefixes) subject to various restrictions such as maximal/minimal height, ordinate of the last point and particular first return decomposition. In some special cases we give bijections with other known combinatorial classes.
Paper 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.