Low-rank matrices with three prescribed off-diagonal values over $\mathbb{F}_p$

Let $p$ be a prime such that $2$ is a primitive root modulo $p$. We prove that, for every three-element set $L\subseteq\mathbb{F}_p$ and every integer $n\geq1$, there exists a symmetric $n\times n$ matrix over $\mathbb{F}_p$ with zero diagonal, off-diagonal entries in $L$, and rank $O_{p,L}(n^{1/3})$. This answers a question of Bukh for all such primes and, in particular, settles the case $L=\{1,4,6\}\subseteq\mathbb{F}_{19}$ singled out on his problem list. When $0\notin L$, a standard polynomial argument shows that the exponent $1/3$ is optimal. The proof combines a geometric construction in characteristic two with an incidence matrix factorization over $\mathbb{F}_p$. The same construction yields integer lifts $L'$ of the prescribed sets $L$ and symmetric $L'$-matrices of rational rank $O_{p,L}(n^{1/3})$. When $0\notin L'$, this improves Bukh's general quadratic lower bound, giving matrices of order $Ω_{p,L}(r^3)$ and rational rank at most $r$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.39908
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Low-rank matrices with three prescribed off-diagonal values over $\mathbb{F}_p$

Firdavs Rakhmonov
arXiv (Cornell University)
Advanced Combinatorial Mathematics
preprint

Low-rank matrices with three prescribed off-diagonal values over $\mathbb{F}_p$

Firdavs Rakhmonov
preprint en

Abstract

Let $p$ be a prime such that $2$ is a primitive root modulo $p$. We prove that, for every three-element set $L\subseteq\mathbb{F}_p$ and every integer $n\geq1$, there exists a symmetric $n\times n$ matrix over $\mathbb{F}_p$ with zero diagonal, off-diagonal entries in $L$, and rank $O_{p,L}(n^{1/3})$. This answers a question of Bukh for all such primes and, in particular, settles the case $L=\{1,4,6\}\subseteq\mathbb{F}_{19}$ singled out on his problem list. When $0\notin L$, a standard polynomial argument shows that the exponent $1/3$ is optimal. The proof combines a geometric construction in characteristic two with an incidence matrix factorization over $\mathbb{F}_p$. The same construction yields integer lifts $L'$ of the prescribed sets $L$ and symmetric $L'$-matrices of rational rank $O_{p,L}(n^{1/3})$. When $0\notin L'$, this improves Bukh's general quadratic lower bound, giving matrices of order $Ω_{p,L}(r^3)$ and rational rank at most $r$.

arXiv (Cornell University)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon