Square values of several polynomials over a finite field
Kaloyan Slavov

TL;DR
This paper estimates the count of solutions over finite fields where multiple polynomial values are nonzero squares, improving error bounds especially for smooth quadrics with nonsingular intersections.
Contribution
It advances previous results by providing sharper error estimates for the distribution of polynomial values as squares over finite fields, focusing on smooth quadrics.
Findings
Improved error bounds for counting solutions where polynomial values are nonzero squares.
Enhanced understanding of the distribution of polynomial values on smooth quadrics.
Refined estimates in the context of intersections of smooth projective quadrics.
Abstract
Let be polynomials in variables with coefficients in a finite field . We estimate the number of points in such that each value is a nonzero square in . The error term is especially small when the define smooth projective quadrics with nonsingular intersections. We improve the error term in a recent work by Asgarli--Yip on mutual position of smooth quadrics.
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
TopicsCoding theory and cryptography
