740 research outputs found
Permutation patterns and statistics
Let S_n denote the symmetric group of all permutations of the set {1, 2,
...,n} and let S = \cup_{n\ge0} S_n. If Pi is a set of permutations, then we
let Av_n(Pi) be the set of permutations in S_n which avoid every permutation of
Pi in the sense of pattern avoidance. One of the celebrated notions in pattern
theory is that of Wilf-equivalence, where Pi and Pi' are Wilf equivalent if
#Av_n(Pi)=#Av_n(Pi') for all n\ge0. In a recent paper, Sagan and Savage
proposed studying a q-analogue of this concept defined as follows. Suppose
st:S->N is a permutation statistic where N represents the nonnegative integers.
Consider the corresponding generating function, F_n^{st}(Pi;q) = sum_{sigma in
Av_n(Pi)} q^{st sigma}, and call Pi,Pi' st-Wilf equivalent if
F_n^{st}(Pi;q)=F_n^{st}(Pi';q) for all n\ge0. We present the first in-depth
study of this concept for the inv and maj statistics. In particular, we
determine all inv- and maj-Wilf equivalences for any Pi containd in S_3. This
leads us to consider various q-analogues of the Catalan numbers, Fibonacci
numbers, triangular numbers, and powers of two. Our proof techniques use
lattice paths, integer partitions, and Foata's fundamental bijection. We also
answer a question about Mahonian pairs raised in the Sagan-Savage article.Comment: 28 pages, 5 figures, tightened up the exposition, noted that some of
the conjectures have been prove
Some open problems on permutation patterns
This is a brief survey of some open problems on permutation patterns, with an
emphasis on subjects not covered in the recent book by Kitaev, \emph{Patterns
in Permutations and words}. I first survey recent developments on the
enumeration and asymptotics of the pattern 1324, the last pattern of length 4
whose asymptotic growth is unknown, and related issues such as upper bounds for
the number of avoiders of any pattern of length for any given . Other
subjects treated are the M\"obius function, topological properties and other
algebraic aspects of the poset of permutations, ordered by containment, and
also the study of growth rates of permutation classes, which are containment
closed subsets of this poset.Comment: 20 pages. Related to upcoming talk at the British Combinatorial
Conference 2013. To appear in London Mathematical Society Lecture Note Serie
Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration
We consider the enumeration of pattern-avoiding involutions, focusing in
particular on sets defined by avoiding a single pattern of length 4. As we
demonstrate, the numerical data for these problems demonstrates some surprising
behavior. This strange behavior even provides some very unexpected data related
to the number of 1324-avoiding permutations
- …