Fishburn and classical permutation enumeration conjecture for 1243 and 3124

Let Fn(σ1,,σk)F_n(\sigma_1,\ldots,\sigma_k) denote Fishburn permutations of length nn avoiding the listed patterns, and let Sn(τ1,,τk)S_n(\tau_1,\ldots,\tau_k) denote ordinary permutations in SnS_n avoiding the listed patterns.

Enumeration conjecture. For every n0n\geq 0,

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

The source reports verification for n15n\leq 15 and cites related generating-tree results for the classical class, but the equality itself remains conjectural.

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.