Hoppen–Lefmann–Odermann conjecture for vector-space colourings
Statement
Fix a prime power , integers , , and sufficiently large . A -star is the family of all -dimensional subspaces of containing a fixed -dimensional subspace. An -colouring assigns one of colours to each -dimensional subspace so that no two subspaces in the same colour intersect in dimension less than .
Hoppen–Lefmann–Odermann conjecture. For -colourings of the -dimensional subspaces of :
- If , a union of pairwise-disjoint -stars is asymptotically optimal.
- If , the number of colourings is maximised by a union of -stars whose centres pairwise intersect only in .
This conjecture extends the known results for three and four colours and predicts the structure of optimal families for all fixed when is sufficiently large. The source does not state a resolution.
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.