ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

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

∣Fn(1324,2143,1423,3124)∣=(n+2)(n2−2n+3)6.|F_n(1324,2143,1423,3124)|=\frac{(n+2)(n^2-2n+3)}{6}.

The source includes this among conjectured enumerations verified only for initial values, and gives no general resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.