Problem 1. Let G = SLn (say), F a finite field.
Statement
Problem 1. Let G = SLn (say), F a finite field. Let A \subset G(F) be a set gener- ating G(F). Assume A contains all permutation matrices. Prove a good bound on diam(Γ(G(F), A)). (Perhaps ≪ (log |G(F)|)O(1) ?) correspond to chains of stabilizers of flags. The latter do not play a role in current proofs of results such as (1), though it is natural to guess that they ought to be helpful, at least for the growth of relatively large subsets A (say, A > |F|); otherwise it is not a priori clear how to obtain even two distinct elements of A \subset SLn (F) stabilizing the same point in An (F) (though see our later discussion on lower bounds of intersections of the form AA−1 \cap C(g)). 4. Stepping back a little: linear algebraic groups G(F) and permutation groups such as Altn are defined in terms of actions – a geometrically meaningful action on affine space An (F)), in one case, and an action on a small, unstructured set [n] = {1, 2, . . . , n}, in the other. The strategies followed to prove 1 and 2 always reflect this similarity and this distinction: the action of G = SLn (say) on An and on itself gives rise to subvarieties of G, whereas the fact that [n] is small compared to Altn implies immediately that a random walk on any Schreier graph for the action Altn y [n] has small mixing time, and so probabilistic arguments are possible and in fact extremely fruitful. Is there a way to use probabilistic ar We can of course assume just that A contains a couple of permutation matrices that generate Alt(n) or Sym(n) (as subgroups of SLn ) and then apply (2).
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.