ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P3,n\mathcal{P}_{3,n} be the set of (3,n)(3,n)-parking functions, let pides⁡(π)=2a1b\operatorname{pides}(\pi)=2^a1^b, let Φ\Phi be the involution whose fixed points are the fixed parking functions, and let S\mathbb{S} be the switch map. The switch-map conjecture. For any π∈P3,n\pi\in\mathcal{P}_{3,n} with pides⁡(π)=2a1b\operatorname{pides}(\pi)=2^a1^b, (a)

dinv⁡(π)=dinv⁡(S(π)).\operatorname{dinv}(\pi)=\operatorname{dinv}(\mathbb{S}(\pi)).

(b) When nn and 33 are coprime, if π\pi is a fixed point of Φ\Phi, then so is S(π)\mathbb{S}(\pi), and

pides⁡(S(π))=2b1a.\operatorname{pides}(\mathbb{S}(\pi))=2^b1^a.

The conjecture was verified for parking functions with at most 10 rows, while the text notes that part (b) fails when nn is a multiple of 33.

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.