Parity problem for pattern-avoidance sequences
Statement
For a finite set of permutation patterns , let denote the number of permutations in avoiding all patterns in . Parity problem. The problem of deciding whether
for every 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.