# Cycles and sorting index for matchings and restricted permutations

Abstract : We prove that the Mahonian-Stirling pairs of permutation statistics $(sor, cyc)$ and $(∈v , \mathrm{rlmin})$ are equidistributed on the set of permutations that correspond to arrangements of $n$ non-atacking rooks on a fixed Ferrers board with $n$ rows and $n$ columns. The proofs are combinatorial and use bijections between matchings and Dyck paths and a new statistic, sorting index for matchings, that we define. We also prove a refinement of this equidistribution result which describes the minimal elements in the permutation cycles and the right-to-left minimum letters.
Keywords :
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]

https://hal.inria.fr/hal-01229666
Contributor : Alain Monteil <>
Submitted on : Tuesday, November 17, 2015 - 10:19:35 AM
Last modification on : Thursday, July 4, 2019 - 12:00:04 PM
Long-term archiving on: : Thursday, February 18, 2016 - 11:33:42 AM

### File

dmAS0162.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01229666, version 1

### Citation

Svetlana Poznanović. Cycles and sorting index for matchings and restricted permutations. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.731-742. ⟨hal-01229666⟩

Record views