Asymptotic monotonicity conjecture for pattern-avoiding ordered set partitions
Let be the symmetric group on letters, let be a permutation, and let denote the number of ordered set partitions of into blocks that avoid . For each fixed , let be a threshold depending only on . Asymptotic monotonicity conjecture. For each fixed , there exists such that for each and ,
The conjecture proposes eventual monotonicity in the number of blocks, beginning at and continuing down to the pattern length.
References
Status
- Solved: Anisse Kasraoui. Pattern avoidance in ordered set partitions and words (arXiv, 2013) https://arxiv.org/abs/1307.0495
Source: Anant Godbole, Adam Goyt, Jennifer Herdan and Lara Pudwell, “Pattern Avoidance in Ordered Set Partitions”, arXiv:1212.2530 (2013).
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.