arXiv Analytics

Sign in

arXiv:2202.05024 [math.CO]AbstractReferencesReviewsResources

On distribution of the depth index on perfect matchings

Yonah Cherniavsky, Yuval Khachatryan-Raziel

Published 2022-02-10Version 1

We study the restriction of depth index statistic on the set of perfect matchings. In particular, we provide additional combinatorial description of the statistic for perfect matchings and calculate the generating polynomial. The main result of the present short paper is that the depth index on perfect matchings is equidistributed with the rank function of the Bruhat order.

Related articles: Most relevant | Search more
arXiv:1510.01900 [math.CO] (Published 2015-10-07)
The Bruhat order on clans
arXiv:math/0502363 [math.CO] (Published 2005-02-16)
Chains in the Bruhat order
arXiv:math/0403095 [math.CO] (Published 2004-03-04, updated 2004-10-14)
Fixed points of involutive automorphisms of the Bruhat order