The sweep map bijectivity conjecture for rational Dyck paths
The sweep map bijectivity conjecture for rational Dyck paths
Given coprime positive integers and , let be the set of rational -Dyck paths, and let be the sweep map that sorts the steps of a path according to the ranks of their starting points, where the rank of is . Sweep map bijectivity conjecture. The sweep map
is a bijective transformation. The conjecture is known in the Fuss case , but remains open for general coprime pairs .
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.