相关论文: On uniquely k-determined permutations

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…

We consider the question of computing the distribution of a permutation statistics over restricted permutations via enumeration schemes. The restricted permutations are those avoiding sets of vincular patterns (which include both classical…

If each edge (u,v) of a graph G=(V,E) is decorated with a permutation pi_{u,v} of k objects, we say that it has a permuted k-coloring if there is a coloring sigma from V to {1,...,k} such that sigma(v) is different from pi_{u,v}(sigma(u))…

A $k$-universal permutation, or $k$-superpermutation, is a permutation that contains all permutations of length $k$ as patterns. The problem of finding the minimum length of a $k$-superpermutation has recently received significant attention…

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…

In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their…

We define the \emph{occurrence graph} $G_p(\pi$) of a pattern $p$ in a permutation $\pi$ as the graph with the occurrences of $p$ in $\pi$ as vertices and edges between the vertices if the occurrences differ by exactly one element. We then…

We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…

In the context of the genome rearrangement problem, we analyze two well known models, namely the reversal and the prefix reversal models, by exploiting the connection with the notion of permutation pattern. More specifically, for any $k$,…

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…

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

We introduce and study a new random permutation model that generalizes the $k$-card minimum model defined by Travers and the Mallows model. We calculate the permuton limit of such a sequence of random permutations. As a corollary, we deduce…

We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method…

Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The distribution of this k!-dimensional vector of pattern…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of length 2, the limiting joint distribution of the number of…

We survey permutation-based methods for approximate k-nearest neighbor search. In these methods, every data point is represented by a ranked list of pivots sorted by the distance to this point. Such ranked lists are called permutations. The…

We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…

Genome rearrangements can be modeled as $k$-breaks, which break a genome at k positions and glue the resulting fragments in a new order. In particular, reversals, translocations, fusions, and fissions are modeled as $2$-breaks, and…

In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…