10 problems

Fine-sequence conjecture. For every $n\geq 1$,

Grassmannian enumeration conjecture. For every $n\geq 1$,

Additional enumeration conjectures. The following identities are conjectured:

Catalan-convolution conjecture. For every $n\geq 1$,

Enumeration conjecture. For every $n\geq 0$,

Enumeration conjecture. For every $n\geq 0$,

Fishburn–classical enumeration conjecture. For every $n\geq 1$,

Four-pattern enumeration conjecture. For every $n\geq 1$,

Gil–Weiner conjecture. For every $n\geq 0$,

Let $\mathscr{F}_n(\sigma)$ denote the set of Fishburn permutations of length $n$ avoiding the pattern $\sigma$. Fishburn-Wilf equivalence conjecture. The three pattern-avoidance c…