Diameter conjecture for McKay graphs of finite simple groups
Statement
For a finite group , let denote its irreducible characters. For a complex character of , the McKay graph is the directed graph with vertex set , with an edge from to exactly when is a constituent of . Write for its diameter.
Diameter conjecture. There is an absolute constant such that for any finite non-abelian simple group , and any nontrivial irreducible character of ,
The conjecture seeks an upper bound for McKay-graph diameters of the same logarithmic order as the natural lower bounds in terms of and the degree . Its status is not established by the supplied text.
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.