The sweep map bijectivity conjecture for rational Dyck paths

Given coprime positive integers mm and nn, let Dm,n\mathcal D_{m,n} be the set of rational (m,n)(m,n)-Dyck paths, and let Φ\Phi be the sweep map that sorts the steps of a path according to the ranks of their starting points, where the rank of (a,b)(a,b) is bmanbm-an. Sweep map bijectivity conjecture. The sweep map

Φ:Dm,nDm,n\Phi:\mathcal D_{m,n}\longrightarrow\mathcal D_{m,n}

is a bijective transformation. The conjecture is known in the Fuss case m=kn±1m=kn\pm1, but remains open for general coprime pairs (m,n)(m,n).

Sources & referencesView supporting material

Primary source

Guoce Xin, “An efficient search algorithm for inverting the sweep map on rational Dyck paths”, arXiv:1505.00823 (2015).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.