Module-support conjecture for maximum 2-intersecting permutation families
Statement
Let be the graph whose vertices are the permutations of an -set, with two vertices adjacent when the corresponding permutations agree on no more than points. Let be the characteristic vector of a maximum independent set in , let be the all-ones vector, and define the depth of a partition by . Module-support conjecture. The vector
lies in the sum of the modules whose partitions have depth no more than , namely
The conjecture proposes a representation-theoretic restriction on maximum 2-intersecting permutation families; the source notes agreement of relevant dimensions for , but leaves the assertion open.
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.