18 problems
Let be the set of all -fans of Dyck paths of length , and define … where . Let be the cyclic group of order acting on…
Promotion conjecture. Theorem 4.11 remains true for any tensor product
Let be a poset with elements and minimal elements. A labeling of is tangled if it requires applications of extended promotion to become a natural labeling. Ho…
Tangled–quasi-tangled inequality. The number of tangled labelings of is less than or equal to the number of quasi-tangled labelings of .
Coloring probability conjecture.
Refined tangled-labeling bound. has at most
Maximum noninvertibility conjecture. For any poset ,
Defant–Kravitz's conjecture. has at most tangled labelings.
Let , let be the restriction function on defined by … and let denote the correspond…
Let be the three-element poset with and , let denote the set of -strict labelings with restriction fu…
Let denote the set of labelings with the stated restriction function, and let be the statistic defined in the preceding formulation. Transl…
Let denote the set of labelings subject to the indicated restriction function, let be the statistic defined by … and let…
Staircase flagged-tableaux cyclic sieving conjecture. The triple exhibits the cyclic sieving phenomenon.
Let be the poset in the source, let denote its set of linear extensions, and let denote promotion. Hopkins–Rubey's conjecture. For e…
Evacuation fixed-point conjecture. For all , the number of Kreweras words of length satisfying is
A standard skew tableau has rows whose sizes weakly decrease from top to bottom; write for the number of rows and let denote its stabilization time, the least at wh…
Assume there is a bijection between generalized oscillating tableaux of length with parts, whose final component is for some , and…
Periodicity conjecture. For every ,