The Dyck-path–tree correspondence for modern intervals and dexter upper ideals
The Dyck-path–tree correspondence for modern intervals and dexter upper ideals
Let be a Dyck path and let be the corresponding planar rooted binary tree under the bijection from Dyck paths to planar rooted binary trees. A correspondence conjecture. The number of modern intervals with minimum in the Tamari lattice equals the size of the dexter upper ideal with minimum . This conjecture predicts an enumerative correspondence between intervals in the Tamari lattice and upper ideals associated with Dyck paths; no resolution is given in the source.
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
Frédéric Chapoton, “Some properties of a new partial order on Dyck paths”, arXiv:1809.10981 (2018).
Additional references
4 papers in this index state this conjecture (2008–2018). The statement above is taken from the most recent of them; the others are arXiv:1110.5850, arXiv:1107.3377, arXiv:0806.3046.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.