Counting occurrences of 132 in an even permutation
Abstract
We study the generating function for the number of even (or odd) permutations on n letters containing exactly r0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r.
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.