ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Qn\mathcal{Q}_n denote the set of Stirling permutations of order nn, and let flat⁡3(Qn)\operatorname{flat}_3(\mathcal{Q}_n) be the set of those with exactly three runs. Three-run enumeration conjecture. The number of Stirling permutations of order nn with exactly three runs is

∣flat⁡3(Qn)∣=2∑k=1n−1(n−1k)(∑j=2n−1−k(n−1−kj))+∑k=2n−1(n−1k)(∑j=2n−1−k(n−1−kj))+∑k=3n−1(2k−1−2)(n−1k).|\operatorname{flat}_3(\mathcal{Q}_n)| = 2\sum\limits_{k = 1}^{n-1} \binom{n-1}{k} \left( \sum\limits_{j = 2}^{n-1 - k} \binom{n-1 -k}{j} \right) + \sum\limits_{k = 2}^{n-1} \binom{n-1}{k} \left( \sum\limits_{j = 2}^{n-1 - k} \binom{n-1 -k}{j} \right) + \sum\limits_{k = 3}^{n-1} (2^{k-1} - 2)\binom{n-1}{k}.

This was computationally verified for 1≤n≤121\leq n\leq 12, but a proof is not supplied.

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.