On the Frobenius complexity of determinantal rings

We compute the Frobenius complexity for the determinantal ring of prime characteristic p obtained by modding out the 2×2 minors of an m×n matrix of indeterminates, where m>n⩾2. We also show that, as p→∞, the Frobenius complexity approaches m−1.