Refined restricted involutions

DOI10.1016/J.EJC.2004.09.006zbMATH Open1110.05003arXivmath/0212267OpenAlexW2071070757MaRDI QIDQ854848FDOQ854848

Authors: Emeric Deutsch, Aaron Robertson, Dan Saracino 

Publication date: 7 December 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Define $I_n^k(alpha)$ to be the set of involutions of $1,2,\mathrm{...},n$ with exactly $k$ fixed points which avoid the pattern $alphain{S}_i$, for some $igeq2$, and define $I_n^k(emptyset;alpha)$ to be the set of involutions of $1,2,\mathrm{...},n$ with exactly $k$ fixed points which contain the pattern $alphain{S}_i$, for some $igeq2$, exactly once. Let $i_n^k(alpha)$ be the number of elements in $I_n^k(alpha)$ and let $i_n^k(emptyset;alpha)$ be the number of elements in $I_n^k(emptyset;alpha)$. We investigate $I_n^k(alpha)$ and $I_n^k(emptyset;alpha)$ for all $alphain{S}_3$. In particular, we show that $i_n^k(132)=i_n^k(213)=i_n^k(321)$, $i_n^k(231)=i_n^k(312)$, $i_n^k(emptyset;132)=i_n^k(emptyset;213)$, and $i_n^k(emptyset;231)=i_n^k(emptyset;312)$ for all $0leqkleqn$.

Full work available at URL: https://arxiv.org/abs/math/0212267

Recommendations

• Restricted \(123\)-involutions
• Asymptotic distribution of fixed points of pattern-avoiding involutions
• Consecutive patterns in restricted permutations and involutions
• On refinements of Wilf-equivalence for involutions
• Refined restricted permutations

zbMATH Keywords

Dyck pathsYoung tableauxpermutation patternspattern-avoiding permutationsoccurrence of patterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10)

Cites Work

• Refined restricted permutations
• Title not available (Why is that?)
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• Restricted permutations
• Permutations with restricted patterns and Dyck paths
• Refined restricted permutations avoiding subsets of patterns of length three
• Some statistics on restricted 132 involutions

Cited In (24)

• Descent sets on 321-avoiding involutions and hook decompositions of partitions
• Folding phenomenon of major-balance identities on restricted involutions
• On refinements of Wilf-equivalence for involutions
• Restricted \(123\)-involutions
• Restricted involutions and Motzkin paths
• Two refined major-balance identities on 321-avoiding involutions
• The fine structure of 4321 avoiding involutions and 321 avoiding involutions
• Pattern-restricted permutations composed of 3-cycles
• Asymptotic distribution of fixed points of pattern-avoiding involutions
• Refined restricted permutations avoiding subsets of patterns of length three
• Prefix exchanging and pattern avoidance by involutions
• Consecutive patterns in restricted permutations and involutions
• The initial involution patterns of permutations
• Enumeration of involutions by descents and symmetric matrices
• Counting covered fixed points and covered arcs in an involution
• Further refinements of Wilf-equivalence for patterns of length 4
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• Symmetric Schröder paths and restricted involutions
• On a refinement of Wilf-equivalence for permutations
• Refined restricted permutations
• Subsequence containment by involutions
• A refinement of Wilf-equivalence for patterns of length 4
• Visibility in restricted involutions
• Enumerating two permutation classes by the number of cycles

Uses Software

• AARON

This page was built for publication: Refined restricted involutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854848)