ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Does a random generating set in Alt(n) give expanders? For what function f (n) does there exist an expanding generating set in Alt(n)f (n) ? Questions by H. Helfgott. There were two questions posed by Helfgott, going as follows. Question 6. Can we prove better bounds for diam(G) with G = SLn (Fq ), say O(1) (log |G|)(log n) ? The second question arises in the context of [12, §2.5]. Let G = Sym(n), k \leq n, Σ = {1, . . . , k}, O = {k + 1, . . . , n}, and A \subset GΣ with A|Σ = Sym(Σ). Note that h(A3 )(Σ) i = hAi(Σ) by Schreier. Assume that hAi(Σ) is non-trivial, it can be equal to Sym(O) if desired. 100 Question 7. What can we say about (Ak )(Σ) ? Is it big? What about its struc- 100 ture? If it is not big, is (Ak )(O) non-trivial?

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.