ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let sns_n denote the number of simple permutations of length nn in the class described above.

Growth conjecture. For n≥12n \geq 12,

sn≥9sn−2.s_n \geq 9s_{n-2}.

If true, this would improve the lower bound on the exponential growth rate of the numbers cnc_n by providing stronger lower bounds for the number of simple permutations.

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.