Related papers: An interesting new Mahonian permutation statistic
We study a generalization of Holte's amazing matrix, the transition probability matrix of the Markov chains of the 'carries' in a non-standard numeration system. The stationary distributions are explicitly described by the numbers which can…
Neither the Euler-Mascheroni constant, $\gamma=0.577215...$, nor the Euler-Gompertz constant, $\delta=0.596347...$, is currently known to be irrational. However, it has been proved that at least one of them is transcendental. The two…
Arslan, Altoum, and Zaarour introduced an inversion statistic for generalized symmetric groups. In this work, we study the distribution of this statistic over colored permutations, including derangements and involutions. By establishing a…
We exploit Krattenthaler's bijection between 123-avoiding permutations and Dyck paths to determine the Eulerian distribution over the set $S_n(123)$ of 123-avoiding permutations in $S_n$. In particular, we show that the descents of a…
We investigate Mahonian and Eulerian probability distributions given by inversions and descents in general finite Coxeter groups. We provide uniform formulas for the means and variances in terms of Coxeter group data in both cases. We also…
A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement graph on the set of permutations of Sn by connecting two…
The topic of the article is the parametric study of the complexity of algorithms on arrays of pairwise distinct integers. We introduce a model that takes into account the non-uniformness of data, which we call the Ewens-like distribution of…
In this work we propose a combinatorial model that generalizes the standard definition of permutation. Our model generalizes the degenerate Eulerian polynomials and numbers of Carlitz from 1979 and provides missing combinatorial proofs for…
Three mathematical constants bear the name of the venerable Leonhard Euler: Euler's number, $e=2.718281\ldots$; the Euler-Mascheroni constant, $\gamma=0.577216\ldots$; and the Euler-Gompertz constant, $\delta=0.596347\ldots$. In the present…
The $k$-arrangements are permutations whose fixed points are $k$-colored. We prove enumerative results related to statistics and patterns on $k$-arrangements, confirming several conjectures by Blitvi\'c and Steingr\'imsson. In particular,…
We introduce a statistic $\pmaj$ on partitions of $[n]=\{1,2,..., n\}$, and show that it is equidistributed with the number of 2-crossings over partitions of $[n]$ with given sets of minimal block elements and maximal block elements. This…
We derive functional equations for distributions of six classical statistics (ascents, descents, left-to-right maxima, right-to-left maxima, left-to-right minima, and right-to-left minima) on separable and irreducible separable…
We introduce new natural generalizations of the classical descent and inversion statistics for permutations, called width-$k$ descents and width-$k$ inversions. These variations induce generalizations of the excedance and major statistics,…
Narayana numbers appear in many places in combinatorics and probability, and it is known that they are asymptotically normal. Using Stein's method of exchangeable pairs, we provide an error of approximation in total variation to a symmetric…
It is known that the normalized volume of standard hypersimplices (defined as some slices of the unit hypercube) are the Eulerian numbers. More generally, a recent conjecture of Stanley relates the Ehrhart series of hypersimplices with…
We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which have the property of specializing to enumerators for the joint distribution of the permutation statistics, major index and excedance…
The mutation process in evolution strategies has been interlinked with the normal distribution since its inception. Many lines of reasoning have been given for this strong dependency, ranging from maximum entropy arguments to the need for…
The Euler-Maclaurin formula which relates a discrete sum with an integral, is generalised to the setting of Riemann-Stieltjes sums and integrals on stochastic processes whose paths are a.s. rectifiable, namely, continuous and with bounded…
We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, $\tau=123$ and $n$ even, is a bijection that associates a Dyck prefix of…
We study the number of random permutations needed to invariably generate the symmetric group, $S_n$, when the distribution of cycle counts has the strong $\alpha$-logarithmic property. The canonical example is the Ewens sampling formula,…