The distribution of consecutive patterns of length 3 in 3-1-2-avoiding permutations
Abstract
We exploit Krattenthaler's bijection between the set Sn(3-1-2) of permutations in Sn avoiding the classical pattern 3-1-2 and Dyck n-paths to study the distribution of every consecutive pattern of length 3 on the set Sn(3-1-2). We show that these consecutive patterns split into 3 equidistribution classes, by means of an involution on Dyck paths due to E.Deutsch. In addition, we state equidistribution theorems concerning triplets of statistics relative to the occurrences of the consecutive patterns of length 3 in a permutation.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.