The power-of-two conjecture for separating class sums of W_n
Statement
Let be the group considered above, and let a separating set be a collection of class sums whose eigenvalues distinguish the irreducible representations of the regular representation of . Power-of-two conjecture. has a separating set consisting of class sums.
The conjecture is motivated by computed separating sets for and by the recursive nature of the groups: the authors expect the smallest separating-set size for to be twice that for . The computation only establishes an upper bound of for , rather than the conjectured size , and the general assertion remains 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.