Refined Restricted Involutions
Emeric Deutsch, Aaron Robertson, Dan Saracino
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.