Low-rank matrices with three prescribed off-diagonal values over
Firdavs Rakhmonov
Source abstract
Let be a prime such that is a primitive root modulo . We prove that, for every three-element set and every integer , there exists a symmetric matrix over with zero diagonal, off-diagonal entries in , and rank . This answers a question of Bukh for all such primes and, in particular, settles the case singled out on his problem list. When , a standard polynomial argument shows that the exponent is optimal. The proof combines a geometric construction in characteristic two with an incidence matrix factorization over . The same construction yields 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 .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.