Non-singular word maps for linear groups

Abstract

We study the word image of words with constants in GL(V) and show that it is large provided the word satisfies some natural conditions on its length and its critical constants. There are various consequences: We prove that for every l ≥ 1, there are only finitely many pairs (n,q) such that the length of the shortest non-singular mixed identity PSLn(q) is bounded by l. We generalize the Hull--Osin dichotomy for highly transitive permutation groups to linear groups over finite fields. Finally, we show that the rank limit of GLn(q) for q fixed and n ∞ is mixed identity free.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…