相关论文: Crossings over permutations avoiding some pairs of…
We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…
In this paper, we consider cyclic permutations that avoid the monotone decreasing permutation $k(k-1)\ldots 21$, whose cycle also demonstrates some pattern avoidance. If the cycle is written in standard form with 1 appearing at the…
In this note we study the {\em asymptotic popularity}, that is, the limit probability to find a given consecutive pattern at a random position in a random permutation in the eighteen classes of permutations avoiding at least two length 3…
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…
The aim of this paper is two-fold. We first prove several new interpretations of a kind of $(q,t)$-Catalan numbers along with their corresponding $\gamma$-expansions using pattern avoiding permutations. Secondly, we give a complete…
Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…
In this paper, we find distribution of descents over $(n-3)$- and $(n-4)$-stack-sortable permutations in terms of Eulerian polynomials. Our results generalize the enumeration results by Claesson, Dukes, and Steingr\'{\i}msson on $(n-3)$-…
Given permutations $\sigma \in S_k$ and $\pi \in S_n$ with $k<n$, the \emph{pattern matching} problem is to decide whether $\pi$ matches $\sigma$ as an order-isomorphic subsequence. We give a linear-time algorithm in case both $\pi$ and…
In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern $3412$ and another pattern.
Partially ordered patterns (POPs) play an important role in the study of permutation patterns, providing a convenient framework for describing large families of classical patterns. The problem of enumerating permutations that avoid POPs has…
Mesh patterns are a generalization of classical permutation patterns that encompass classical, bivincular, Bruhat-restricted patterns, and some barred patterns. In this paper, we describe all mesh patterns whose avoidance is coincident with…
Inspired by a recent note of Zeilberger (arXiv:1110.4379), Alejandro Morales asked whether one can count alternating (i.e., up-down) permutations that contain the pattern 123 or 321 exactly once. In this note we answer the question in the…
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…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…
Pattern avoiding machines were introduced recently by Claesson, Cerbai and Ferrari as a particular case of the two-stacks in series sorting device. They consist of two restricted stacks in series, ruled by a right-greedy procedure and the…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…
The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through…
We provide a bijection between a class of 3-dimensional pattern avoiding permutations and triangle bases, special sets of integer points arising from the theory of tilings and TEP subshifts. This answers a conjecture of Bonichon and Morel.
The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class,…