Related papers: Positional Marked Patterns in Permutations

We extend and generalize many of the enumerative results concerning West's stack-sorting map $s$. First, we prove a useful theorem that allows one to efficiently compute $|s^{-1}(\pi)|$ for any permutation $\pi$, answering a question of…

Using the recently developed notion of permutation limits this paper derives the limiting distribution of the number of fixed points and cycle structure for any convergent sequence of random permutations, under mild regularity conditions.…

We present general links between statistics of non-Hermitian random matrices and the distribution of the number of cycles of some specific random permutations. In particular, we derive explicit formulas for the generating functions of the…

A matching of the set $[2n]=\{ 1,2,\ldots ,2n\}$ is a partition of $[2n]$ into blocks with two elements, i.e. a graph on $[2n]$ such that every vertex has degree one. Given two matchings $\sigma$ and $\tau$ , we say that $\sigma$ is a…

Let $I=[0,1]$ and consider disjoint closed regions $G_{1},....,G_{n}$ in $% I\times I$ and subintervals $I_{1},......,I_{n},$ such that $G_{i}$ projects onto $I_{i.}$ We define the lower and upper maps $\tau_{1},$ $\tau_{2}$ by the lower…

Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…

Two permutations $\pi$ and $\tau$ are c-Wilf equivalent if, for each $n$, the number of permutations in $S_n$ avoiding $\pi$ as a consecutive pattern (i.e., in adjacent positions) is the same as the number of those avoiding $\tau$. In…

The consecutive pattern poset is the infinite partially ordered set of all permutations where $\sigma\le\tau$ if $\tau$ has a subsequence of adjacent entries in the same relative order as the entries of $\sigma$. We study the structure of…

A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations. Let $S_n(\sigma_1, \sigma_2, \ldots, \sigma_r)$ be the set of permutations in the symmetric group $S_n$ which avoids…

We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations. In particular, we show…

A feature of certain ensembles of random matrices is that the corresponding measure is invariant under conjugation by unitary matrices. Study of such ensembles realised by matrices with Gaussian entries leads to statistical quantities…

A parking function on $[n]$ creates a permutation in $S_n$ via the order in which the $n$ cars appear in the $n$ parking spaces. Placing the uniform probability measure on the set of parking functions on $[n]$ induces a probability measure…

We study the complexity of the decision problem known as Permutation Pattern Matching, or PPM. The input of PPM consists of a pair of permutations $\tau$ (the `text') and $\pi$ (the `pattern'), and the goal is to decide whether $\tau$…

For about 10 years, the classification of permutation patterns was thought completed up to length 6. In this paper, we establish a new class of Wilf-equivalent permutation patterns, namely, (n-1,n-2,n,tau)~(n-2,n,n-1,tau) for any tau in…

In this paper, we study properties and patterns on permutations of multisets whose multivariate generating functions are symmetric. We interpret this phenomenon through the lens of group actions and define such a property or pattern as…

The Permutation Pattern Matching problem, asking whether a pattern permutation $\pi$ is contained in a permutation $\tau$, is known to be NP-complete. In this paper we present two polynomial time algorithms for special cases. The first…

Let $A=(a_{ij})$ be an $n$-by-$n$ matrix. For any real number $\mu$, we define the polynomial $$P_\mu(A)=\sum_{\sigma\in S_n} a_{1\sigma(1)}\cdots a_{n\sigma(n)}\,\mu^{\ell(\sigma)}\; ,$$ as the $\mu$-permanent of $A$, where $\ell(\sigma)$…

Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed…

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…

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…