2025/12/02 by Ghasemi, Fatemeh, Gross, Gal, Kopparty, Swastik
Mathematics · #Limits and Structures in Graph Theory #Analytic Number Theory Research #Random Matrices and Applications
paper · doi:10.48550/arxiv.2512.03221
This paper is motivated by basic complexity and probability questions about permanents of random matrices over finite fields, and in particular, about properties separating the permanent and the determinant. Fix q = pm some power of an odd prime, and let k ≤ n both be growing. For a uniformly random n × k matrix A over \mathbbFq, we study the probability that all k × k submatrices of A have zero permanent; namely that A does not have full "permanental rank". When k = n, this is simply the probability that a random square matrix over \mathbbFq has zero permanent, which we do not understand. We believe that the probability in this case is (1)/(q) + o(1), which would be in contrast to the case of the determinant, where the answer is (1)/(q) + Ωq(1). Our main result is that when k is O(√(n)), the probability that a random n × k matrix does not have full permanental rank is essentially the same as the probability that the matrix has a 0 column, namely (1 +o(1)) (k)/(qn). In contrast, for determinantal (standard) rank the analogous probability is Θ((qk)/(qn)). At the core of our result are some basic linear algebraic properties of the permanent that distinguish it from the determinant.