Fishburn-to-classical pattern enumeration conjecture for 2143 and 3124

From papers

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 Sn(τ1,,τk)S_n(\tau_1,\ldots,\tau_k) denote the set of permutations in SnS_n avoiding the listed classical patterns.

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

Fn(2143,3124)=Sn(231,4123).|F_n(2143,3124)|=|S_n(231,4123)|.

The source presents this as an open conjectured coincidence between Fishburn and ordinary pattern-avoiding permutation classes.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

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

Solutions 0

No solutions have been posted yet.