ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each n≥1n\geq 1, let an{1,3}(σ)a_n^{\{1,3\}}(\sigma) count length-nn permutations avoiding the pattern σ\sigma whose cycle lengths belong to {1,3}\{1,3\}, and let an{1,2,3}(σ)a_n^{\{1,2,3\}}(\sigma) count length-nn permutations avoiding σ\sigma whose cycle lengths belong to {1,2,3}\{1,2,3\}. Pattern-avoidance inequalities conjecture. For n≥1n\geq 1, one has

an{1,3}(132)≤an{1,3}(321)a_n^{\{1,3\}}(132) \leq a_n^{\{1,3\}}(321)

and

an{1,2,3}(123)≤an{1,2,3}(132)≤an{1,2,3}(321)≤an{1,2,3}(231).a_n^{\{1,2,3\}}(123) \leq a_n^{\{1,2,3\}}(132)\leq a_n^{\{1,2,3\}}(321)\leq a_n^{\{1,2,3\}}(231).

These inequalities are conjectured from numerical evidence in the cited tables; the supplied text does not establish them or report a 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.