10 problems
Gessel–Zhuang's conjecture. Every shuffle-compatible statistic is a descent statistic.
Let be a Coxeter system with length function . For , let be its inversion set, where…
For a permutation , let and denote its descent top and descent bottom sets. Patterns are…
Let be the set of permutations of length . For a permutation , define its descent bottom set by … Two patterns are Desbot-Wilf equivalent if their avoidance classes…
Let denote the number of permutations in the symmetric group on letters whose double descent set is . Let be finite sets such that…
Let denote the number of permutations in the symmetric group on letters whose double descent set is . For fixed , the positive ratio-limi…
Let denote the number of permutations in the symmetric group on letters whose double descent set is . For with…
Let denote the number of permutations in the symmetric group on letters whose double descent set is . Given a fixed , the down-up-down-up conjectur…
Let denote the number of permutations in the symmetric group on letters whose double descent set is . For fixed , the asymptotic equidistribution…
Let a permutation statistic be a statistic on permutations, and call it shuffle-compatible if the multiset of its values on shuffles of two permutations depends only on the two inp…