Permanental rank versus determinantal rank of random matrices over finite fields
Fatemeh Ghasemi, Gal Gross, Swastik Kopparty

TL;DR
This paper investigates the probability that random matrices over finite fields have zero permanent in all submatrices, revealing fundamental differences from the determinant and providing new insights into permanental rank.
Contribution
It establishes the asymptotic probability of zero permanental rank for random matrices over finite fields, highlighting key algebraic distinctions from the determinant.
Findings
Probability that a random matrix has zero permanental rank is approximately k/q^n for small k.
Contrast between permanental and determinantal rank probabilities over finite fields.
Main result applies when k is O(√n), revealing fundamental algebraic differences.
Abstract
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 some power of an odd prime, and let both be growing. For a uniformly random matrix over , we study the probability that all submatrices of have zero permanent; namely that does not have full "permanental rank". When , this is simply the probability that a random square matrix over has zero permanent, which we do not understand. We believe that the probability in this case is , which would be in contrast to the case of the determinant, where the answer is . Our main result is that when is , the probability that a random $n…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · Random Matrices and Applications
