Open growth questions include: for a graph, what lower bounds can be given for the difference between its two largest adjacency eigenvalues; for A in an abelian group, how…
Statement
Open growth questions include: for a graph, what lower bounds can be given for the difference between its two largest adjacency eigenvalues; for A in an abelian group, how large is A+A compared with A; and for A in a general group, how large is A·A·A compared with A, and why?
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.