An optimal bound on the number of determinants generated by a subset in $\mathbb{F}_q^d$
Nguyen Van The

TL;DR
This paper establishes a near-optimal bound on the size of a subset in a finite field vector space that guarantees the set of determinants generated covers the entire field, extending previous results.
Contribution
It proves a nearly optimal size condition for subsets in finite fields to generate all possible determinants, generalizing earlier work.
Findings
Set of determinants equals the entire field for large enough subsets
Bound is nearly optimal in the context of finite field geometry
Generalizes previous determinant set results
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).
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
