Refined restricted permutations avoiding subsets of patterns of length three

DOI10.1007/S00026-002-8031-2MaRDI QIDQ1400792zbMATH OpenOpenAlexFDO

Authors Toufik Mansour, Aaron Robertson

Publication date 14 August 2003

Published in Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

pattern-avoidancerestricted permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15)

Abstract: Define $S_n^k(T)$ to be the set of permutations of $1,2,\mathrm{...},n$ with exactly $k$ fixed points which avoid all patterns in $Tsubseteq{S}_m$. We enumerate $S_n^k(T)$, $Tsubseteq{S}_3$, for all $|T|geq2$ and $0leqkleqn$.

Recommendations

• Refined restricted permutations
• Permutations restricted by two distinct patterns of length three
• scientific article; zbMATH DE number 2188398
• scientific article; zbMATH DE number 1504635
• Refined restricted involutions

Cited in

(11)

• Crossings over permutations avoiding some pairs of patterns of length three
• Permutations restricted by two distinct patterns of length three
• scientific article; zbMATH DE number 2188398 (Why is no real title available?)
• Fixed points and excedances in restricted permutations
• Consecutive up-down patterns in up-down permutations
• Refined restricted permutations
• Refined restricted involutions
• Distributions of statistics over pattern-avoiding permutations
• Pattern avoidance for alternating permutations and Young tableaux
• Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations
• Restricted 1-3-2 permutations and generalized patterns

Describes a project that uses

Uses Software

• AARON

This page was built for publication: Refined restricted permutations avoiding subsets of patterns of length three

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