Pattern avoidance in cyclically ordered structures

We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider speciflcally three scenarios for permutations: linear, cyclic and hybrid, the flrst one corresponding to classical permutation avoidance. The cyclic modiflcation allows for circular shifts in the entries. Using two bijections, both ascribable to both Deutsch and Krattenthaler independently, we single out two geometrically signiflcant classes of Dyck paths that correspond to two instances of simultaneous avoidance in the purely linear case, and to two distinct patterns in the hybrid case: non-decreasing Dyck paths (flrst considered by Barcucci et al.), and Dyck paths with at most one long vertical or horizontal edge. We derive generating functions counting Dyck paths by their number of low and high peaks, and long horizontal and vertical edges. These give various results on statistics of 321-avoiding permutations, including the joint excedance-flxed points and descent-inverse descent distributions. In particular we give an explicit formula for the number of 321-avoiding permutations with precisely k descents, a problem brought up in the recent work of Reifegerste. In both the hybrid and purely cyclic scenarios, we deal with the avoidance enumeration problem for all patterns of length up to 4. Simple Dyck paths also have a connection to the purely cyclic case; here the orbit-counting lemma gives a formula involving the Euler totient function and leads us to consider an interesting subgroup of the symmetric group.