Related papers: Shuffle-compatible permutation statistics

Beginning with work of Zeilberger on classical pattern counts, there are a variety of structural results for moments of permutation statistics applied to random permutations. Using tools from representation theory, Gaetz and Ryba…

Let G be a finite group. Let pi be a permutation from S{n}. We study the distribution of probabilities of equality a{1} a{2} ...a{n-1}a{n}=a{pi{1}}^{epsilon{1}} a{pi_{2}}^{epsilon{2}}...a{pi{n-1}}^{epsilon_{n-1}} a_{pi_{n}}^{epsilon{n}},…

We consider a component of the word statistics known as clump; starting from a finite set of words, clumps are maximal overlapping sets of these occurrences. This parameter has first been studied by Schbath with the aim of counting the…

We construct bijections to show that two pairs of sextuple set-valued statistics of permutations are equidistributed on symmetric groups. This extends a recent result of Sokal and the second author valid for integer-valued statistics as…

We present a proof of the compositional shuffle conjecture, which generalizes the famous shuffle conjecture for the character of the diagonal coinvariant algebra. We first formulate the combinatorial side of the conjecture in terms of…

Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the…

In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…

This paper is devoted to the estimation of the shift parameter in a semiparametric regression model when the distribution of the observation times is unknown. Hence, we propose to use a stochastic algorithm which takes into account the…

This paper is concerned with the theoretical understanding of $\alpha$-stable sheets $U$ on $\mathbb{R}^d$. Our motivation for this is in the context of Bayesian inverse problems, where we consider these processes as prior distributions,…

The distribution of certain Mahonian statistic (called $\mathrm{BAST}$) introduced by Babson and Steingr\'{i}msson over the set of permutations that avoid vincular pattern $1\underline{32}$, is shown bijectively to match the distribution of…

Generalizing the notion of a vexillary permutation, we introduce a filtration of S_infinity by the number of Schur function terms in the Stanley symmetric function, with the kth filtration level called the k-vexillary permutations. We show…

A mixture of shifted asymmetric Laplace distributions is introduced and used for clustering and classification. A variant of the EM algorithm is developed for parameter estimation by exploiting the relationship with the general inverse…

It is well known since the seminal work by Bousquet-M\'elou, Claesson, Dukes and Kitaev (2010) that certain refinements of the ascent sequences with respect to several natural statistics are in bijection with corresponding refinements of…

We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions of Steingrimsson and Williams (math.CO/0507149), in particular, on the distribution of the bistatistic…

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

In this article, we study the shuffle quadri-algebra H. We prove the existence of some relations between quadri-algebra laws which constitute shuffle product, the concatenation product and the deconcatenation coproduct. We also show that…

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…

Incorporating symmetries into the numerical solution of differential equations has been a mainstay of research over the last 40 years, however, one aspect is less known and under-utilised: discretisations of partial differential equations…

We study Stirling permutations defined by Gessel and Stanley. We prove that their generating function according to the number of descents has real roots only. We use that fact to prove that the distribution of these descents, and other,…

Charge transfer statistics of quantum particles is obtained by analysing the time evolution of the many-body wave function. Exploiting properly chosen gauge transformations, we construct the probabilities for transfers of a discrete number…