ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let qq be a prime number. The group GL(n,q)\mathrm{GL}(n,q) acts naturally on GF(q)n\mathrm{GF}(q)^n, and is regarded as a subgroup of Sym(GF(q)n)\mathrm{Sym}(\mathrm{GF}(q)^n). Fast general linear group conjecture. GL(n,q)\mathrm{GL}(n,q) is fast in Sym(GF(q)n)\mathrm{Sym}(\mathrm{GF}(q)^n). Partial results show that permutation matrices are fast in the general linear group, and that for large qq almost all elements of GL(n,q)\mathrm{GL}(n,q) can be computed in nn linear instructions. The question is whether the entire general linear group is fast.

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.