The existence conjecture for k-symmetric permutations
Statement
Let be the symmetric group on symbols. For and , let count the occurrences of the pattern in . Call -symmetric when for all . Let mean that holds for every , where means . Existence conjecture for symmetric permutations. If , then there exists a -symmetric permutation on symbols. The divisibility condition is necessary because each of the patterns must occur equally often. The conjecture asks whether this necessary condition is sufficient; the paper notes that the first nontrivial unresolved search in the case occurs at .
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.