(Prior to publication, this paper should be cited as arXiv:1312.2649.)
For any prime power q, let G(q) denote the group of permutations of the finite field Fq which is generated by those permutations that can be written as c → acm + bcn for some 0 < m < n < q and some nonzero a, b in Fq. We show that there are infinitely many q for which G(q) is the group of all permutations of Fq which fix 0. This resolves a conjecture of Vasilyev and Rybalkin.
Michael Zieve: home page publication list