Refined Restricted Involutions
Abstract
Define Ink(α) to be the set of involutions of \1,2,...,n\ with exactly k fixed points which avoid the pattern α ∈ Si, for some i ≥ 2, and define Ink(;α) to be the set of involutions of \1,2,...,n\ with exactly k fixed points which contain the pattern α ∈ Si, for some i ≥ 2, exactly once. Let ink(α) be the number of elements in Ink(α) and let ink(;α) be the number of elements in Ink(;α). We investigate Ink(α) and Ink(;α) for all α ∈ S3. In particular, we show that ink(132)=ink(213)=ink(321), ink(231)=ink(312), ink(;132) =ink(;213), and ink(;231)=ink(;312) for all 0 ≤ k ≤ n.
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.