Related papers: Refined Wilf-equivalences by Comtet statistics
We prove a formula expressing the gradient of the phase function of a function $f: \mathbb R^d \mapsto \mathbb C$ as a normalized first frequency moment of the Wigner distribution for fixed time. The formula holds when $f$ is the Fourier…
This study focuses on statistical inference for the class of quasi-infinitely divisible (QID) distributions, which was recently introduced by Lindner, Pan and Sato (2018). The paper presents a Fourier approach, based on the analogue of the…
We give an alternative proof of several sharp commutator estimates involving Riesz transforms, Riesz potentials, and fractional Laplacians. Our methods only involve harmonic extensions to the upper half-space, integration by parts, and…
Let $M_n$ be a $n \times n$ Wigner or sample covariance random matrix, and let $\mu_1(M_n), \mu_2(M_n), ..., \mu_n(M_n)$ denote the unordered eigenvalues of $M_n$. We study the fluctuations of the partial linear eigenvalue statistics $$…
Frobenius observed that the number of times an element of a finite group is obtained as a commutator is given by a specific combination of the irreducible characters of the group. More generally, for any word w the number of times an…
In this case-study in computer-human collaboration, we develop, implement, and execute symbolic-computational algorithms for the automatic discovery and proof of explicit expressions for the expectation, variance, and higher moments of a…
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
This paper extends Edgeworth-Cornish-Fisher expansions for the distribution and quantiles of nonparametric estimates in two ways. Firstly it allows observations to have different distributions. Secondly it allows the observations to be…
Pattern-avoiding permutations are a central object of study in both combinatorics and theoretical computer science. In this paper we design a data structure that can store any size-$n$ permutation $\tau$ that avoids an arbitrary (and…
In this paper, we study the pattern occurrence in $k$-ary words. We prove an explicit upper bound on the number of $k$-ary words avoiding any given pattern using a random walk argument. Additionally, we reproduce several already known…
Simsun permutations, Andr\'e I permutations and Andr\'e II permutations are three combinatorial models for Euler numbers. It's known that the descent statistic is equidistributed over the set of Andr\'e I permutations and the set of simsun…
Testing large covariance matrices is of fundamental importance in statistical analysis with high-dimensional data. In the past decade, three types of test statistics have been studied in the literature: quadratic form statistics, maximum…
A four-variable distribution on permutations is derived, with two dual combinatorial interpretations. The first one includes the number of fixed points "fix", the second the so-called "pix" statistic. This shows that the duality between…
Recently, the study of patterns in inversion sequences was initiated by Corteel-Martinez-Savage-Weselcouch and Mansour-Shattuck independently. Motivated by their works and a double Eulerian equidistribution due to Foata (1977), we…
Common intervals have been defined as a modelisation of gene clusters in genomes represented either as permutations or as sequences. Whereas optimal algorithms for finding common intervals in permutations exist even for an arbitrary number…
In multivariate statistics, estimating the covariance matrix is essential for understanding the interdependence among variables. In high-dimensional settings, where the number of covariates increases with the sample size, it is well known…
We derive the joint asymptotic distribution of the outlier eigenvalues of an additively deformed Wigner matrix $H$. Our only assumptions on the deformation are that its rank be fixed and its norm bounded. Our results extend those of [The…
In this paper we refine the well-known permutation statistic "descent" by fixing parity of (exactly) one of the descent's numbers. We provide explicit formulas for the distribution of these (four) new statistics. We use certain differential…
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…
This paper introduces a version of decoupling and randomization to establish concentration inequalities for double-indexed permutation statistics. The results yield, among other applications, a new combinatorial Hanson-Wright inequality and…