Equidistribution conjecture for ascents and descents of perfect matchings

From papers

Let \PM2n\PM_{2n} denote the set of perfect matchings on [2n][2n], and let \Asc(m)\Asc(m) and \Des(m)\Des(m) be the ascent and descent sets of a matching m\PM2nm\in\PM_{2n}, defined by the relative order of sims_i\cdot m and mm in the matching order. For J[2n1]J\subseteq[2n-1], write

tJ:=jJtj.\boldsymbol{t}^J:=\prod_{j\in J}t_j.

Equidistribution conjecture. For all nNn\in\mathbb{N},

m\PM2nt\Asc(m)=m\PM2nt\Des(m).\sum_{m\in\PM_{2n}}\boldsymbol{t}^{\Asc(m)}=\sum_{m\in\PM_{2n}}\boldsymbol{t}^{\Des(m)}.

This asserts that the ascent and descent set statistics on perfect matchings are equidistributed. The equality has been verified experimentally for 2n142n\leq14; the stronger question of Schur-positivity with respect to \Des\Des remains unresolved.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Avichai Marmor, “Schur-Positivity of Short Chords in Matchings”, arXiv:2307.09894 (2026).

Solutions 0

No solutions have been posted yet.