The small Fuss-Schröder path–sparse noncrossing partition bijection conjecture
Let and be positive integers, and let be a type with denoting its size. A small -Fuss-Schröder path is a path of type and length , and a connected sparse noncrossing partition is a sparse noncrossing partition with one connected component. The small-path bijection conjecture. The set of small -Fuss-Schröder paths of type and length is in bijection with the set of connected sparse noncrossing partitions of such that
- the arc type is ;
- for , the set of th blocks consists of blocks of arc type and singleton blocks; and
- the set of the last blocks has at least singleton blocks for .
This conjecture is presented as the connected-partition counterpart of the preceding large-path conjecture: when the second connected component in the large case is a singleton block, the corresponding path is small. The supplied text gives no evidence that this conjecture has been proved or refuted.
References
- Suhyung An, JiYoon Jung and Sangwook Kim, “Enumeration of Fuss-Schröder paths”, arXiv:1701.00378 (2017).
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
No solutions have been posted yet.