ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be the permutohedron, and let H0H_0 be its affine hull. For an affine hyperplane H≠H0H\ne H_0, consider the number of vertices in H∩PnH\cap P_n. Maximum intersection conjecture. If nn is odd, then every hyperplane different from H0H_0 contains at most (n−1)!(n-1)! points of PnP_n. This bound would explain the lower bound in the preceding covering conjecture for odd nn; 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 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.