paper

Low-rank matrices with three prescribed off-diagonal values over

arXiv:2610.39908

Abstract

For every prime and every three-element set , we prove that, for every integer , there exists a symmetric matrix over with zero diagonal, off-diagonal entries in , and rank . This answers a question of Bukh. When , a standard polynomial argument shows that the exponent is optimal. The proof combines an incidence matrix factorization with a projective-plane construction controlling line-intersection numbers modulo . A separate geometric construction in characteristic two yields better explicit constants in certain cases, and also gives integer lifts of the prescribed sets and symmetric -matrices of rational rank . When , this improves Bukh's general quadratic lower bound, giving matrices of order and rational rank at most .

arXiv comment14 pages. The second author has been added. Theorem 1.1 has been extended to cover all primes