On distribution of the depth index on perfect matchings

Yonah Cherniavsky; Yuval Khachatryan-Raziel

On distribution of the depth index on perfect matchings

Yonah Cherniavsky, Yuval Khachatryan-Raziel

Department of Mathematics

Research output: Working paper › Preprint

2 Downloads (Pure)

Abstract

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.

Original language	Undefined/Unknown
State	Published - 10 Feb 2022

Keywords

math.CO

Access to Document

2202.05024v2

Cite this

@techreport{6aa52aaef0f44794a13253afc8a3fc9b,

title = "On distribution of the depth index on perfect matchings",

abstract = "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.",

keywords = "math.CO",

author = "Yonah Cherniavsky and Yuval Khachatryan-Raziel",

year = "2022",

month = feb,

day = "10",

language = "???core.languages.und???",

type = "WorkingPaper",

}

TY - UNPB

T1 - On distribution of the depth index on perfect matchings

AU - Cherniavsky, Yonah

AU - Khachatryan-Raziel, Yuval

PY - 2022/2/10

Y1 - 2022/2/10

N2 - 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.

AB - 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.

KW - math.CO

M3 - פרסום מוקדם

BT - On distribution of the depth index on perfect matchings

ER -