相关论文: Andre' permutations, right-to-left and left-to-rig…

In the seminal contribution [4] the joint weak convergence of maxima and minima of weakly dependent stationary sequences is derived under some mild asymptotic conditions. In this paper we address additionally the case of incomplete samples…

In this paper we consider arbitrary intervals in the left weak order on the symmetric group $S_n$. We show that the Lehmer codes of permutations in an interval form a distributive lattice under the product order. Furthermore, the…

In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass…

We consider Kemp's q-analogue of the binomial distribution. Several convergence results involving the classical binomial, the Heine, the discrete normal, and the Poisson distribution are established. Some of them are q-analogues of…

We introduce a metric on the set of permutations of given order, which is a weighted generalization of Kendall's $\tau$ rank distance and study its properties. Using the edge graph of a permutohedron, we give a criterion which guarantees…

We consider the joint distribution of the area and perimeter statistics on the set I_n of inversion sequences of length n represented as bargraphs. Functional equations for both the ordinary and exponential generating functions are derived…

This paper considers the asymptotic distribution of the longest edge of the minimal spanning tree and nearest neighbor graph on X_1,...,X_{N_n} where X_1,X_2,... are i.i.d. in \Re^2 with distribution F and N_n is independent of the X_i and…

The aim of this paper is to study the $\lambda$-Stirling numbers of both kinds which are $\lambda$-analogues of Stirling numbers of both kinds. Those numbers have nice combinatorial interpretations when $\lambda$ are positive integers. If…

We calculate the large deviations for the length of the longest alternating subsequence and for the length of the longest increasing subsequence in a uniformly random permutation that avoids a pattern of length three. We treat all six…

A multi-parafermion basis of states for the Z_k parafermionic models is derived. Its generating function is constructed by elementary steps. It corresponds to the Andrews multiple-sum which enumerates partitions whose parts separated by the…

We discuss the spectral asymptotics of some open subsets of the real line with random fractal boundary and of a random fractal, the continuum random tree. In the case of open subsets with random fractal boundary we establish the existence…

The Euler number $E_n$ (resp. Entringer number $E_{n,k}$) enumerates the alternating (down-up) permutations of $\{1,\dots,n\}$ (resp. starting with $k$). The Springer number $S_n$ (resp. Arnold number $S_{n,k}$) enumerates the type $B$…

We give a distribution-dependent concentration inequality for functions of independent variables. The result extends Bernstein's inequality from sums to more general functions, whose variation in any argument does not depend too much on the…

We obtain extremal majorants and minorants of exponential type for a class of even functions on $\R$ which includes $\log |x|$ and $|x|^\alpha$, where $-1 < \alpha < 1$. We also give periodic versions of these results in which the majorants…

We consider permutations of $\{1,...,n\}$ obtained by $\lfloor\sqrt{n}t\rfloor$ independent applications of random stirring. In each step the same marked stirring element is transposed with probability $1/n$ with any one of the $n$…

A simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We…

This paper initiates a limit theory of permutation valued processes, building on the recent theory of permutons. We apply this to study the asymptotic behaviour of random sorting networks. We prove that the Archimedean path, the conjectured…

It is shown that a certain functional of a branching process has representations in terms of both a maximisation problem and a minimisation problem. A consequence of these representation is that upper and lower bounds on the functional can…

We show that very simple continued fractions can be obtained for the ordinary generating functions enumerating permutations or D-permutations with a large number of independent statistics, when each cycle is given a weight $-1$. The proof…

A celebrated analogy between prime factorizations of integers and cycle decompositions of permutations is explored here. Asymptotic formulas characterizing semismooth numbers (possessing at most several large factors) carry over to random…