Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polynomials
Abstract
We say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist a<b such that πa<πb<πb+1. We study the distribution of several statistics in Motzkin permutations, including the length of the longest increasing and decreasing subsequences and the number of rises and descents. We also enumerate Motzkin permutations with additional restrictions, and study the distribution of occurrences of fairly general patterns in this class of permutations.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.