The γ_2-character bridge conjecture for the hyperoctahedral group
Statement
Let be the hyperoctahedral group and let be its natural representation. Let be the tensor product graph, let denote its identity representation, and let -even and -odd refer to the two parity classes in the graph. Write for the eccentricity of , and let and denote the adversary quantity and the relevant quantum query-complexity quantity, respectively. -character bridge conjecture. The following hold: (i) has a bipartite -parity structure, with every edge crossing between the -even and -odd classes; (ii) a bottleneck irreducible representation is , unique for and one of four co-bottlenecks for , and
(iii) under the adversary tightness conjecture,
This conjectural bridge connects the adversary bound with the tensor product graph and predicts the exact graph distance and query-complexity relation. The supplied text does not establish the adversary tightness conjecture or the resulting equalities, so the status 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.