Pattern Avoidance in Parking Functions
From MaRDI portal
Abstract: In this paper, we view parking functions viewed as labeled Dyck paths in order to study a notion of pattern avoidance first introduced by Remmel and Qiu. In particular we enumerate the parking functions avoiding any set of two or more patterns of length 3, and we obtain a number of well-known combinatorial sequences as a result. Along the way, we find bijections between specific sets of pattern-avoiding parking functions and a number of combinatorial objects such as partitions of polygons and trees with certain restrictions.
This page was built for publication: Pattern Avoidance in Parking Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6410160)
