相关论文: Longest increasing subsequences in pattern-restric…

Let $(X_k)_{k\geq 1}$ and $(Y_k)_{k\geq 1}$ be two independent sequences of i.i.d. random variables, with values in a finite and totally ordered alphabet $\mathcal{A}_m:=\{1,\dots,m\}$, and having respective probability mass function…

Let $S_{n}$ denote the set of permutations of $[n]=\{1,2,\dots, n\}$. For each integer $k\geq 1$, let $S_{n,k}$ be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles. A subset $H\subseteq S_{n,k}$ is to be a matching if…

It is known that the number of permutations in the symmetric group $S_{2n}$ with cycles of odd lengths only is equal to the number of permutations with cycles of even lengths only. We prove a refinement of this equality, involving descent…

We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of \emph{consecutive} pattern occurrences. We also characterize random limiting objects for this new topology introducing a…

We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…

We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the distance (i. e., the gap) between two consecutive symbols of…

We revisit staircases for words and prove several exact as well as asymptotic results for longest left-most staircase subsequences and subwords and staircase separation number, the latter being defined as the number of consecutive maximal…

We study the distribution of the occurrence of rare patterns in sufficiently mixing Gibbs random fields on the lattice $\mathbb{Z}^d$, $d\geq 2$. A typical example is the high temperature Ising model. This distribution is shown to converge…

We establish a scaling limit result for the length $\operatorname{LIS}(\sigma_n)$ of the longest increasing subsequence of a permutation $\sigma_n$ of size $n$ sampled from the Brownian separable permuton $\boldsymbol{\mu}_p$ of parameter…

A permutation is \it separable \rm if it can be obtained from the singleton permutation by iterating direct sums and skew sums. Equivalently, it is separable if and only it avoids the patterns 2413 and 3142. Under the uniform probability on…

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 use local limits of Galton-Watson trees to establish local limit theorems for permutations conditioned to avoid a pattern of length three. In the case of 321-avoiding permutations our results resolve an open problem of Pinsky. In the…

In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal. We enumerate…

We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance in permutations on partially ordered sets. The number of permutations on $P$ that avoid the pattern $\pi$ is denoted $Av_P(\pi)$. We…

We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-$s$ {\em double DS} sequences, for all $s$, sharp bounds on sequences…

In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…

An endhered (end-adhered) pattern is a subset of arcs in matchings, such that the corresponding starting points are consecutive and the same holds for the ending points. Such patterns are in one-to-one correspondence with the permutations.…

Let $(X_i)_{i \geq 1}$ and $(Y_i)_{i\geq1}$ be two independent sequences of independent identically distributed random variables taking their values in a common finite alphabet and having the same law. Let $LC_n$ be the length of the…

We evaluate the probabilities of various events under the uniform distribution on the set of 312-avoiding permutations of 1,...,N. We derive exact formulas for the probability that the ith element of a random permutation is a specific value…

Our main result is a limit shape theorem for the two-dimensional surface defined by a uniform random n-by-n square Young tableau. The analysis leads to a calculus of variations minimization problem that resembles the minimization problems…