相关论文: A Wilf equivalence related to two stack sortable p…

Inversion sequences of length $n$ are integer sequences $e_1,\ldots ,e_n$ with $0\le e_i<i$ for all $i$, which are in bijection with the permutations of length $n$. In this paper, we classify all Wilf equivalence classes of pattern-avoiding…

In this paper we continue the study of permutations avoiding the vincular pattern $1-32-4$ by constructing a generating tree with a single label for these permutations. This construction finally provides a clearer explanation of why a…

We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never…

In this paper, we compute the distributions of the statistic number of crossings over permutations avoiding one of the pairs $\{321,231\}$, $\{123,132\}$ and $\{123,213\}$. The obtained results are new combinatorial interpretations of two…

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

In 1990 West conjectured that there are $2(3n)!/((n+1)!(2n+1)!)$ two-stack sortable permutations on $n$ letters. This conjecture was proved analytically by Zeilberger in 1992. Later, Dulucq, Gire, and Guibert gave a combinatorial proof of…

A permutation $\sigma\in\mathfrak{S}_n$ is simsun if for all $k$, the subword of $\sigma$ restricted to $\{1,...,k\}$ does not have three consecutive decreasing elements. The permutation $\sigma$ is double simsun if both $\sigma$ and…

In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

When specialized to the context of permutations, Schmerl and Trotter's Theorem states that every simple permutation which is not a parallel alternation contains a simple permutation with one fewer entry. We give an elementary proof of this…

The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…

The problem of determining which permutations can be sorted using certain switchyard networks dates back to Knuth in 1968. In this work, we are interested in permutations which are sortable on a double-ended queue (called a deque), or on…

The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the (n-1)/2th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance…

The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…

A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n]^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to…

Using the approach suggested in [arXiv:1002.2761] we present below a sufficient condition guaranteeing that two collections of patterns of permutations have the same exponential generating functions for the number of permutations avoiding…

We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating,…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

We enumerate the pattern class Av(2143,4231) and completely describe its permutations. The main tools are simple permutations and monotone grid classes.

Inversion sequences are finite sequences of non-negative integers, where the value of each entry is bounded from above by its position. Patterns in inversion sequences have been studied by Corteel-Martinez-Savage-Weselcouch and…