Lower bounds on the strength of the determinant
We establish new lower bounds for the strength and partition rank of the determinant. For every prime $p$, we prove the exact identity \[ \operatorname{str}(\mathrm{det}_p)=p. \] A weak monotonicity argument, combined with a bound for gaps between consecutive primes, then gives $\operatorname{str}(\mathrm{det}_n)\ge (1...