Related papers: Crossing and alignments of permutations

We introduce k-crossings and k-nestings of permutations. We show that the crossing number and the nesting number of permutations have a symmetric joint distribution. As a corollary, the number of k-noncrossing permutations is equal to the…

We derive the continued fraction form of the generating function of some new $q$-analogs of the Eulerian numbers $\hat{E}_{k,n}(q)$ introduced by Lauren Williams building on work of Alexander Postnikov. They are related to the number of…

We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which…

The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The involutions switching nesting and crossing numbers for set…

Non-crossing and non-nesting permutations are variations of the well-known Stirling permutations. A permutation $\pi$ on $\{1,1,2,2,\ldots, n,n\}$ is called non-crossing if it avoids the crossing patterns $\{1212,2121\}$ and is called…

We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block…

The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of $n$ sites. It is partially…

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

This note contains two results on the distribution of crossing numbers and nesting numbers in permutations of type B. More precisely, we prove a Bn- analogue of the symmetric distribution of crossings and nestings of permutations due to…

We define and consider k-distant crossings and nestings for matchings and set partitions, which are a variation of crossings and nestings in which the distance between vertices is important. By modifying an involution of Kasraoui and Zeng…

We show that the bistatistic of right nestings and right crossings in matchings without left nestings is equidistributed with the number of occurrences of two certain patterns in permutations, and furthermore that this equidistribution…

We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection between partial matchings avoiding three…

We introduce the mathematical theory of the particle systems that interact via permutations, where the transition rates are assigned not to the jumps from a site to a site, but to the permutations themselves. This permutation processes can…

Recently, Chen et al. derived the generating function for partitions avoiding right nestings and posed the problem of finding the generating function for partitions avoiding right crossings. In this paper, we derive the generating function…

We study the distribution of the statistics 'number of fixed points' and 'number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving…

The notion of $r$-crossing and $r$-nesting of a complete matching was introduced and a symmetry property was proved by Chen et al. [Trans. Amer. Math. Soc. 359 (2007) 1555-1575]. We consider random matchings of large size and study their…

In this thesis, we introduced and carried out a combinatorial study of permutations that avoid one or two patterns of length 3 according to the statistic number of crossings. For this purpose, we manipulated a bijection of Elizalde and Pak…

For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…

For a subclass of matchings, set partitions, and permutations, we describe a direct bijection involving only arc annotated diagrams that not only interchanges maximum nesting and crossing numbers, but also all refinements of crossing and…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…