ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥1n\geq 1, and let Evac⁡\operatorname{{Evac}} and Evac⁡∗\operatorname{{Evac}}^{*} denote the two evacuation operations on Kreweras words of length 3n3n. For a word ww, consider the fixed-point conditions Evac⁡∗(w)=w\operatorname{{Evac}}^{*}(w)=w and Evac⁡(w)=w\operatorname{{Evac}}(w)=w.

Evacuation fixed-point conjecture. For all n≥1n\geq 1, the number of Kreweras words of length 3n3n satisfying Evac⁡∗(w)=w\operatorname{{Evac}}^{*}(w)=w is

3⌊n/2⌋4⌈n/2⌉∏j=1⌊n/2⌋(3j−1)∏j=1⌈n/2⌉(3j−2)(n+1)!.\frac{3^{\lfloor n/2 \rfloor} 4^{\lceil n/2 \rceil} \prod_{j=1}^{\lfloor n/2 \rfloor}(3j-1) \prod_{j=1}^{\lceil n/2 \rceil}(3j-2) }{(n+1)!}.

The number satisfying Evac⁡(w)=w\operatorname{{Evac}}(w)=w is the same when nn is even and is 00 when nn is odd. These formulas provide product expressions for the evacuation fixed points, while their status beyond the conjecture is not established in the supplied text.

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.