English
Related papers

Related papers: Euler-Mahonian distributions of type $B_n$

200 papers

Permutation tableaux are combinatorial objects related with permutations and various statistics on them. They appeared in connection with total positivity in Grassmannians, and stationary probabilities in a PASEP model. In particular they…

Combinatorics · Mathematics 2017-09-13 Sylvie Corteel , Matthieu Josuat-Vergès , Jang Soo Kim

We follow the approach developed by Beilinson-Lusztig-MacPherson and modified by Fu and the first author to investigate a new realization for the i-quantum groups U^j(n) of type B, building on the multiplication formulas discovered in…

Quantum Algebra · Mathematics 2020-11-06 Jie Du , Yadi Wu

Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…

Probability · Mathematics 2020-08-10 Manjunath Krishnapur

Let $\Phi_k(n)=|\{ (x_1, x_2, \cdots, x_k)\in \left(\mathbb{Z}/n\mathbb{Z}\right)^k; \ \gcd(x_1^2+x_2^2+ \cdots+ x_k^2, n)=1\}|$ be a general totient function introduced first by Cald\'{e}ron et. al. Motivated by the classical works of…

Number Theory · Mathematics 2023-04-06 Debika Banerjee , Bittu Chahal , Sneha Chaubey , Khyati Khurana

We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…

Probability · Mathematics 2015-05-27 Laszlo Erdos , Antti Knowles , Horng-Tzer Yau , Jun Yin

The Alder-Andrews Theorem, a partition inequality generalizing Euler's partition identity, the first Rogers-Ramanujan identity, and a theorem of Schur to $d$-distinct partitions of $n$, was proved successively by Andrews in 1971, Yee in…

Number Theory · Mathematics 2024-07-29 Leah Sturman , Holly Swisher

We relate properties of weighted flags (or multiflags) of type AD to statistics of the corresponding Weyl groups. For type A, we recover the Mahonian statistics on symmetric groups. Finally, we sketch briefly an easy extension incorporating…

Combinatorics · Mathematics 2018-11-13 Roland Bacher

The $k$-dimensional generalized Euler function $\varphi_k(n)$ is defined to be the number of ordered $k$-tuples $(a_1,a_2,\ldots, a_k) \in \mathbb{N}^k$ with $1\leq a_1,a_2,\ldots, a_k \leq n$ such that both the product $a_1a_2\cdots a_k$…

Number Theory · Mathematics 2021-06-29 Subha Sarkar

Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the…

Combinatorics · Mathematics 2022-02-08 Cristina Ballantine , Hannah E. Burson , Amanda Folsom , Chi-Yun Hsu , Isabella Negrini , Boya Wen

Riemannian Gaussian distributions were initially introduced as basic building blocks for learning models which aim to capture the intrinsic structure of statistical populations of positive-definite matrices (here called covariance…

Statistics Theory · Mathematics 2023-02-16 Salem Said , Simon Heuveline , Cyrus Mostajeran

Recently, Jel\'inek conjectured that there exists a bijection between certain restricted permutations and Fishburn matrices such that the bijection verifies the equidistribution of several statistics. The main objective of this paper is to…

Combinatorics · Mathematics 2018-08-14 Dandan Chen , Sherry H. F. Yan , Robin D. P. Zhou

We show that the Riemannian Gaussian distributions on symmetric spaces, introduced in recent years, are of standard random matrix type. We exploit this to compute analytically marginals of the probability density functions. This can be done…

Mathematical Physics · Physics 2021-10-29 Leonardo Santilli , Miguel Tierz

Given $n\in\mathbb{N}$, let $\omega\left(n\right)$ denote the number of distinct prime factors of $n$, let $Z$ denote a standard normal variable, and let $P_{n}$ denote the uniform distribution on $\left\{ 1,\ldots,n\right\} $. The…

Number Theory · Mathematics 2020-11-03 Joseph Squillace

A deterministic sequence of real numbers in the unit interval is called \emph{equidistributed} if its empirical distribution converges to the uniform distribution. Furthermore, the limit distribution of the pair correlation statistics of a…

Number Theory · Mathematics 2016-12-19 Christoph Aistleitner , Thomas Lachmann , Florian Pausinger

We prove that the Mahonian-Stirling pairs of permutation statistics $(\sor, \cyc)$ and $(\inv, \mathrm{rlmin})$ are equidistributed on the set of permutations that correspond to arrangements of $n$ non-atacking rooks on a Ferrers board with…

Combinatorics · Mathematics 2012-06-07 Svetlana Poznanovik

We generalize an equidistribution theorem \`a la Bader-Muchnik for operator-valued measures constructed from a family of boundary representations associated with Gibbs measures in the context of convex cocompact discrete group of isometries…

Group Theory · Mathematics 2016-01-12 Adrien Boyer , Dustin Mayeda

We give a new description of the flag major index, introduced by Adin and Roichman, by using a major index defined by Reiner. This allows us to establish a connection between an identity of Reiner and some more recent results due to Chow…

Combinatorics · Mathematics 2009-09-23 Riccardo Biagioli , Jiang Zeng

We present (bi-)symmetric generating functions for the joint distributions of Euler-Stirling statistics on permutations, including the number of descents ($\mathsf{des}$), inverse descents ($\mathsf{ides}$), the number of left-to-right…

Combinatorics · Mathematics 2022-10-18 Emma Yu Jin

The G\"ollnitz-Gordon identities were found by G\"ollnitz and Gordon independently. In 1967, Andrews obtained a combinatorial generalization of the G\"ollnitz-Gordon identities, called the Andrews-G\"ollnitz-Gordon theorem. In 1980,…

Combinatorics · Mathematics 2022-03-08 Thomas Y. He , Alice X. H. Zhao

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson
‹ Prev 1 3 4 5 6 7 10 Next ›