On squares in subsets of finite fields with restrictions on coefficients of basis decomposition
Mikhail Gabdullin

TL;DR
This paper estimates the number of squares in subsets of finite fields with restricted coefficients in a basis, providing weaker conditions for the existence of squares than previous results.
Contribution
It introduces new bounds on the count of squares in structured subsets of finite fields with coefficient restrictions, improving upon prior conditions for their existence.
Findings
Derived estimates for the number of squares in subsets with coefficient restrictions.
Established weaker sufficient conditions for the existence of squares in these subsets.
Compared results to previous work, showing improved bounds.
Abstract
We consider the linear vector space formed by the elements of the finite fields with over . Let be a basis of this space. Then the elements of have a unique representation in the form with . Let be a subset of . We consider the set of elements of such that for all . We give an estimate for the number of squares in the set which implies a weaker sufficient condition for the existence of squares in the set than in the recent paper of C.Dartyge, C.Mauduit, A.S\'ark\"ozy.
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 · Limits and Structures in Graph Theory · Finite Group Theory Research
