An optimal bound on the number of determinants generated by a subset in $\mathbb{F}_q^d$
Number Theory
2020-12-25 v3 Combinatorics
Abstract
In this short note, we prove that for with then the set of determinants generated by is This result is nearly optimal and generalizes the previous results of Vinh (2013) and Iosevich, Rudnev and Zhai (2015).
Cite
@article{arxiv.2012.06140,
title = {An optimal bound on the number of determinants generated by a subset in $\mathbb{F}_q^d$},
author = {Nguyen Van The},
journal= {arXiv preprint arXiv:2012.06140},
year = {2020}
}
Comments
This short note is rewritten by a thread on Mathoverflow of Will Sawin with a slight improvement and the history of problems