On the solvability of systems of equations revisited
Thang Pham, Steven Senger, Nguyen Trung-Tuan, Nguyen Duc-Thang, Le Anh, Vinh

TL;DR
This paper presents a new approach to analyze the solvability of systems of equations generated by bilinear forms, establishing lower bounds on the number of solutions for large sets in finite fields.
Contribution
It introduces a direct method to study bilinear form systems and improves previous bounds on the number of solutions in finite field settings.
Findings
For sets with size much greater than q^{5/3}, the number of solution triples is at least proportional to q^3.
The approach significantly improves previous results from 2009.
Provides a lower bound on the number of solutions for large sets in finite fields.
Abstract
In this paper, we introduce a new and direct approach to study the solvability of systems of equations generated by bilinear forms. More precisely, let be a non-degenerate bilinear form and be a set in . We prove that if then the number of triples with is at least for some positive constant . This significantly improves a result due to the fifth listed author (2009).
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
TopicsNumerical methods for differential equations
