Cameron–Liebler conjecture for Boolean degree 1 functions on Grassmann graphs
Statement
Let and let be the Grassmann graph whose vertices are the -dimensional subspaces of . A function on the vertices is Boolean degree if it takes values in and is a real linear combination of the incidence functions of points and hyperplanes. Cameron–Liebler conjecture. Let and . If is a Boolean degree function on , then depends on at most one point and one hyperplane. The conjecture is disproved: many counterexamples are known when and .
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.