3 problems

Enumeration conjecture.

Burstein–Jones's dominance conjecture. For all $n\geq0$,

Let $\mathfrak{D}^1_{2n}$ denote the set of Dumont-1 permutations of length $2n$, and let $\mathfrak{D}^1_{2n}(\tau)$ denote those avoiding the pattern $\tau$. Burstein–Jones's Wil…