Can we prove better bounds for diam(G) with G = SLn (Fq ), say O(1) (log |G|)(log n) ?
Statement
Can we prove better bounds for diam(G) with G = SLn (Fq ), say O(1) (log |G|)(log n) ? What can we say about (Ak )(Σ) ? What about its struc- 100 ture? Questions by S. Eberhard. There were four questions posed by Eberhard. Three of them are marked as (Q1), (Q2), (Q3) in his extended abstract. The fourth one goes as follows. Question 5. What is the length of the shortest law on Sn ? It is known that a law must have length at least 2n − 1, and at most exp(O((log n)4 log log n)) by Kozma–Thom [15]. Questions by M. Kassabov. There were two questions posed by Kassabov, going as follows. Question 8. Does a random generating set in Alt(n) give expanders? Question 9. For what function f (n) does there exist an expanding generating set in Alt(n)f (n) ?
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.