相关论文: Permutations Restricted by Two Distinct Patterns o…

Define $S_n^k(T)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid all patterns in $T \subseteq S_m$. We enumerate $S_n^k(T)$, $T \subseteq S_3$, for all $|T| \geq 2$ and $0 \leq k \leq n$.

Define $S_n^k(\alpha)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $\alpha \in S_m$. Let $s_n^k(\alpha)$ be the size of $S_n^k(\alpha)$. We investigate $S_n^0(\alpha)$ for all…

In this paper, we find an explicit formulas, or recurrences, in terms of generating functions for the cardinalities of the sets $S_n(T;\tau)$ of all permutations in $S_n$ that contain $\tau\in S_k$ exactly once and avoid a subset…

The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…

Recently, Babson and Steingrimsson (see \cite{BS}) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. In this paper we study the generating…

We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…

For $\eta\in S_3$, let $S_n^{\text{av}(\eta)}$ denote the set of permutations in $S_n$ that avoid the pattern $\eta$, and let $E_n^{\text{av}(\eta)}$ denote the expectation with respect to the uniform probability measure on…

In this paper, we find explicit formulas or generating functions for the cardinalities of the sets $S_n(T,\tau)$ of all permutations in $S_n$ that avoid a pattern $\tau\in S_k$ and a set $T$, $|T|\geq 2$, of patterns from $S_3$. The main…

A permutation $\pi \in S_n$ is said to {\it avoid} a permutation $\sigma \in S_k$ whenever $\pi$ contains no subsequence with all of the same pairwise comparisons as $\sigma$. For any set $R$ of permutations, we write $S_n(R)$ to denote the…

In this paper we calculate the cardinality of the set S_n(T,tau) of all permutations in S_n that avoid one pattern from S_4 and a nonempty set of patterns from S_3.

We study pattern avoidance by combinatorial objects other than permutations, namely by ordered partitions of an integer and by permutations of a multiset. In the former case we determine the generating function explicitly, for integer…

Let $st=\{st_1,\ldots,st_k\}$ be a set of $k$ statistics on permutations with $k\geq 1$. We say that two given subset of permutations $T$ and $T'$ are $st$-Wilf-equivalent if the joint distributions of all statistics in $st$ over the sets…

The permutation language $P_n$ consists of all words that are permutations of a fixed alphabet of size $n$. Using divide-and-conquer, we construct a regular expression $R_n$ that specifies $P_n$. We then give explicit bounds for the length…

Define $I_n^k(\alpha)$ to be the set of involutions of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $\alpha \in S_i$, for some $i \geq 2$, and define $I_n^k(\emptyset;\alpha)$ to be the set of involutions of…

Let I_n(\pi) denote the number of involutions in the symmetric group S_n which avoid the permutation \pi. We say that two permutations \alpha,\beta\in\S{j} may be exchanged if for every n, k, and ordering \tau of j+1,...,k, we have…

Circular permutations on {1,2,...,n} that avoid a given pattern correspond to ordinary (linear) permutations that end with n and avoid all cyclic rotations of the pattern. Three letter patterns are all but unavoidable in circular…

We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…

Let T_k^m={\sigma \in S_k | \sigma_1=m}. We prove that the number of permutations which avoid all patterns in T_k^m equals (k-2)!(k-1)^{n+1-k} for k <= n. We then prove that for any \tau in T_k^1 (or any \tau in T_k^k), the number of…

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Babson and Steingr\`imsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the…