Maximum hyperplane intersection conjecture for odd-dimensional permutohedra
Statement
Let be the permutohedron, and let be its affine hull. For an affine hyperplane , consider the number of vertices in . Maximum intersection conjecture. If is odd, then every hyperplane different from contains at most points of . This bound would explain the lower bound in the preceding covering conjecture for odd ; the source presents the assertion as an unproved belief.
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.