Gil–Weiner enumeration conjecture for three Fishburn pattern classes II

Let Fn(σ1,,σk)F_n(\sigma_1,\ldots,\sigma_k) denote the set of Fishburn permutations of length nn avoiding each listed pattern, and let |\cdot| denote cardinality.

Gil–Weiner conjecture. For every n0n\geq 0,

Fn(3214)=Fn(4132)=Fn(4213).|F_n(3214)|=|F_n(4132)|=|F_n(4213)|.

The source places this among open enumerative conjectures attributed to Gil and Weiner; no general proof or disproof is given.

Sources & referencesView supporting material

Primary source

Eric S. Egge, “Pattern-Avoiding Fishburn Permutations and Ascent Sequences”, arXiv:2208.01484 (2022).

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.