Related papers: Descent pattern avoidance

We consider the probability that a weighted sum of $n$ i.i.d. random variables $X_j$, $j = 1, . . ., n$, with stretched exponential tails is larger than its expectation and determine the rate of its decay, under suitable conditions on the…

We present a new and relatively elementary method for studying the solution of the initial-value problem for dispersive linear and integrable equations in the large-$t$ limit, based on a generalization of steepest descent techniques for…

For $\eta\in S_3$, let $S_n^{\text{av}(\eta)}$ denote the set of permutations in $S_n$ that avoid the pattern $\eta$, and let $E_n^{\text{av}(\eta)}$ denote the expectation with respect to the uniform probability measure on…

We obtain asymptotics of large Hankel determinants whose weight depends on a one-cut regular potential and any number of Fisher-Hartwig singularities. This generalises two results: 1) a result of Berestycki, Webb and Wong [5] for root-type…

We investigate permutations and involutions that avoid a pattern of length three and have a {\em unique} longest increasing subsequence.

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

We study the asymptotic behavior of short cycles of random permutations with cycle weights. More specifically, on a specially constructed metric space whose elements encode all possible cycles, we consider a point process containing all…

The main theme of this paper is the enumeration of the occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the number of $n$-array $k$-ary words that contain a given…

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…

An open conjecture in pattern avoidance theory is that the distribution of the major index among 321-avoiding permutations is distributed unimodally. We construct a formula for this distribution, and in the case of 2 descents prove…

In this paper, we take the first step towards an extension of the nonlinear steepest descent method of Deift, Its and Zhou to the case of operator Riemann-Hilbert problems. In particular, we provide long range asymptotics for a Fredholm…

We consider the error term of the asymptotic formula for the number of pairs of $k$-free integers up to $x$. Our error term improves results by Heath-Brown, Brandes and Dietmann/Marmon. We then extend our results to $r$-tuples of $k$-free…

We derive an asymptotic expansion for the distribution of a compound sum of independent random variables, all having the same light-tailed subexponential distribution. The examples of a Poisson and geometric number of summands serve as an…

We determine the asymptotic behavior of twisted traces of singular moduli with a power-saving error term in both the discriminant and the order of the pole at $i\infty$. Using this asymptotic formula, we obtain an exact formula for these…

This paper studies properties of binary runlength-limited sequences with additional constraints on their Hamming weight and/or their number of runs of identical symbols. An algebraic and a probabilistic (entropic) characterization of the…

Finding distributions of permutation statistics over pattern-avoiding classes of permutations attracted much attention in the literature. In particular, Bukata et al. found distributions of ascents and descents on permutations avoiding any…

We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…

This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects not covered in the recent book by Kitaev, \emph{Patterns in Permutations and words}. I first survey recent developments on the enumeration…

In this paper, we derive sharp asymptotics for the spectral data (eigenvalues and weight numbers) of the fourth-order linear differential equation with a distribution coefficient and three types of separated boundary conditions. Our methods…

Discrete random probability measures are a key ingredient of Bayesian nonparametric inferential procedures. A sample generates ties with positive probability and a fundamental object of both theoretical and applied interest is the…