English
Related papers

Related papers: Mahonian Statistics and Vincular Patterns on Permu…

200 papers

We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…

Probability · Mathematics 2026-04-10 Alexander Clay

Canonical correlation analysis is a family of multivariate statistical methods for the analysis of paired sets of variables. Since its proposition, canonical correlation analysis has for instance been extended to extract relations between…

Machine Learning · Computer Science 2017-11-08 Viivi Uurtio , João M. Monteiro , Jaz Kandola , John Shawe-Taylor , Delmiro Fernandez-Reyes , Juho Rousu

In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…

Combinatorics · Mathematics 2007-05-23 John Shareshian , Michelle L. Wachs

Multiple imputation is a highly recommended technique to deal with missing data, but the application to longitudinal datasets can be done in multiple ways. When a new wave of longitudinal data arrives, we can treat the combined data of…

Methodology · Statistics 2026-05-18 X. M. Kavelaars , S. van Buuren , J. R. van Ginkel

We establish new conditions under which a sequence of real numbers has metric Poissonian pair correlation. These conditions strengthen results of Aistleitner, El-Baz and Munsch (2021) and resolve one of their open problems under a mild…

Number Theory · Mathematics 2025-08-15 Bryce Kerr , Hongliang Wang

The Mallows measure on the symmetric group $S_n$ is the probability measure such that each permutation has probability proportional to $q$ raised to the power of the number of inversions, where $q$ is a positive parameter and the number of…

Probability · Mathematics 2015-09-29 Carl Mueller , Shannon Starr

A crucial permutation is a permutation that avoids a given set of prohibitions, but any of its extensions, in an allowable way, results in a prohibition being introduced. In this paper, we introduce five natural types of crucial…

Combinatorics · Mathematics 2022-06-28 Sergey Avgustinovich , Sergey Kitaev , Anna Taranenko

One of the remarkable properties of cluster algebras is that any cluster, obtained from a sequence of mutations from an initial cluster, can be written as a Laurent polynomial in the initial cluster (known as the "Laurent phenomenon").…

Mathematical Physics · Physics 2014-04-01 Allan P Fordy

It is well-known that the set $\mathbf I_n$ of involutions of the symmetric group $\mathbf S_n$ corresponds bijectively - by the Foata map $F$ - to the set of $n$-permutations that avoid the two vincular patterns $\underline{123},$…

Combinatorics · Mathematics 2023-06-22 M. Barnabei , F. Bonetti , N. Castronuovo , M. Silimbani

We initiate a probabilistic study of forward stability for products of Schubert polynomials through the record statistic (left-to-right maxima) of permutations. Building on the explicit record formula for forward stability obtained by Hardt…

Combinatorics · Mathematics 2026-04-06 Andrew Hardt , Reuven Hodges , Hanzhang Yin

Motivated by an approach to visualization of high dimensional statistical data given in Hurley and Oldford (2011), this work examines the clique structure of $J_n(m, m-1)$ Johnson graphs. Cliques and maximal cliques are characterized and…

Combinatorics · Mathematics 2022-08-29 Pavel Shuldiner , R. Wayne Oldford

We study (asymmetric) $U$-statistics based on a stationary sequence of $m$-dependent variables; moreover, we consider constrained $U$-statistics, where the defining multiple sum only includes terms satisfying some restrictions on the gaps…

Probability · Mathematics 2022-03-10 Svante Janson

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

Combinatorics · Mathematics 2007-05-23 Harry Buhrman , Ming Li , John Tromp , Paul Vitanyi

Tangent numbers $T_{2n-1}$, which enumerate alternating permutations of odd length, play a prominent role in the Taylor series expansion of the tangent function $\tan(x)$. In this work, we adopt a combinatorial approach based on the…

Combinatorics · Mathematics 2026-03-25 Jean-Christophe Pain

We consider a pivotal monoidal functor whose domain is a modular tensor category (MTC). We show that the trace of such a functor naturally extends to a representation of the corresponding tube category. As irreducible representations of the…

Quantum Algebra · Mathematics 2021-02-23 Leonard Hardiman

Using classical transformations on the symmetric group and two transformations constructed in Fix-Mahonian Calculus I, we show that several multivariable statistics are equidistributed either with the triplet (fix,des,maj), or the pair…

Combinatorics · Mathematics 2007-05-23 Dominique Foata , Guo-Niu Han

We study classical pattern counts in Mallows random permutations with parameters $(n,q_n)$, as $n\to\infty$. We focus on three different regimes for the parameter $q = q_n$. When $n^{3/2}(1-q)\to0$, we use coupling techniques to prove that…

Probability · Mathematics 2024-10-23 Victor Dubach

We extend the study of jumping numbers of multiplier ideals due to Ein-Lazarsfeld-Smith-Varolin from the algebraic case to the case of general plurisubharmonic functions. While many properties from Ein-Lazarsfeld-Smith-Varolin are shown to…

Algebraic Geometry · Mathematics 2020-01-09 Dano Kim , Hoseob Seo

We use the framework of multivariate regular variation to analyse the extremal behaviour of preferential attachment models. To this end, we follow a directed linear preferential attachment model for a random, heavy-tailed number of steps in…

Probability · Mathematics 2024-08-06 Anja Janßen , Max Ziegenbalg

Two mesh patterns are coincident if they are avoided by the same set of permutations. In this paper, we provide necessary conditions for this coincidence, which include having the same set of enclosed diagonals. This condition is sufficient…

Combinatorics · Mathematics 2016-05-27 Anders Claesson , Bridget Eileen Tenner , Henning Ulfarsson