Permutations restricted by two distinct patterns of length three

DOI10.1006/AAMA.2001.0749MaRDI QIDQ5956781zbMATH OpenOpenAlexFDO

Authors Aaron Robertson

Publication date 11 September 2002

Published in Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

patternspermutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: Define $S_n(R;T)$ to be the number of permutations on $n$ letters which avoid all patterns in the set $R$ and contain each pattern in the multiset $T$ exactly once. In this paper we enumerate $$ and $$ for all $$. The results for $$ follow from two papers by Mansour and Vainshtein.

Recommendations

• Refined restricted permutations avoiding subsets of patterns of length three
• scientific article; zbMATH DE number 1504635
• Refined restricted permutations
• scientific article; zbMATH DE number 2192121
• scientific article; zbMATH DE number 2188398

Cites work

• Continued fractions and Catalan problems
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Forbidden subsequences
• Forbidden subsequences and Chebyshev polynomials
• From Motzkin to Catalan permutations
• scientific article; zbMATH DE number 4168687 (Why is no real title available?)
• scientific article; zbMATH DE number 1375582 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1447312 (Why is no real title available?)
• Permutation patterns and continued fractions
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Permutations with forbidden subsequences and a generalized Schröder number
• Permutations with one or two 132-subsequences
• Restricted permutations
• Restricted permutations, continued fractions, and Chebyshev polynomials
• Sorting twice through a stack
• Symmetric functions and P-recursiveness
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• The number of permutations containing exactly one increasing subsequence of length three
• The permutation classes equinumerous to the smooth class

Cited in

(14)

• Refined restricted permutations avoiding subsets of patterns of length three
• Refined restricted permutations
• Words restricted by 3-letter generalized multipermutation patterns
• Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
• Restricted 1-3-2 permutations and generalized patterns
• On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation
• Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
• scientific article; zbMATH DE number 1504635 (Why is no real title available?)
• scientific article; zbMATH DE number 3895076 (Why is no real title available?)
• scientific article; zbMATH DE number 7106992 (Why is no real title available?)
• scientific article; zbMATH DE number 2188398 (Why is no real title available?)
• scientific article; zbMATH DE number 2192121 (Why is no real title available?)
• Restricted 132-avoiding permutations
• Permutations of a multiset avoiding permutations of length 3

This page was built for publication: Permutations restricted by two distinct patterns of length three

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