ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a finite set of permutation patterns F\mathcal{F}, let Cn(F)C_n(\mathcal{F}) denote the number of permutations in SnS_n avoiding all patterns in F\mathcal{F}. Parity problem. The problem of deciding whether

Cn(F)≡0(mod2)C_n(\mathcal{F})\equiv 0\pmod 2

for every n∈Nn\in\mathbb N is undecidable. The authors present this as an open problem extending their undecidability theorem and expect their methods may eventually prove it, although substantially more work is required.

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.