arXiv Analytics

Sign in

arXiv:2202.02089 [math.CO]AbstractReferencesReviewsResources

Mahonian and Euler-Mahonian statistics for set partitions

Shao-Hua Liu

Published 2022-02-04Version 1

A partition of the set $[n]:=\{1,2,\ldots,n\}$ is a collection of disjoint nonempty subsets (or blocks) of $[n]$, whose union is $[n]$. In this paper we consider the following rarely used representation for set partitions: given a partition of $[n]$ with blocks $B_{1},B_{2},\ldots,B_{m}$ satisfying $\max B_{1}<\max B_{2}<\cdots<\max B_{m}$, we represent it by a word $w=w_{1}w_{2}\ldots w_{n}$ such that $i\in B_{w_{i}}$, $1\leq i\leq n$. We prove that the Mahonian statistics INV, MAJ, MAJ$_{d}$, $r$-MAJ, Z, DEN, MAK, MAD are all equidistributed on set partitions via this representation, and that the Euler-Mahonian statistics (des, MAJ), (mstc, INV), (exc, DEN), (des, MAK) are all equidistributed on set partitions via this representation.

Related articles: Most relevant | Search more
arXiv:1806.02316 [math.CO] (Published 2018-06-06)
Set partitions without blocks of certain sizes
arXiv:1511.00192 [math.CO] (Published 2015-11-01)
Pattern avoidance for set partitions à la Klazar
arXiv:1402.3619 [math.CO] (Published 2014-02-14)
On the distribution of some Euler-Mahonian statistics