A note on bilinear sums with modular square roots
Stephan Baier

TL;DR
This paper extends previous work on bilinear sums over finite fields to include sums involving modular square roots, providing new bounds and insights for these sums.
Contribution
It introduces an analogous result for bilinear sums with modular square roots, building on prior methods and reviewing related recent research.
Findings
Established bounds for bilinear sums involving modular square roots.
Extended previous methods to the case s=1/2 in bilinear sums.
Reviewed recent related work on bilinear sums.
Abstract
Bag and Shparlinski \cite{BaSh} considered bilinear sums of terms of the form , where is a prime, is an integer coprime to , is an integer, runs over a subset of and runs over an interval. Closely following their method, we establish an analogous result for the case when ( being a modular square root of modulo , if existent). A part of this note is devoted to reviewing our recent works on related bilinear sums.
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.
