The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2014
DOI: 10.1515/form.2011.155
|View full text |Cite
|
Sign up to set email alerts
|

The sovability of norm, bilinear and quadratic equations over finite fields via spectra of graphs

Abstract: In this paper we will give a unified proof of several results on the sovability of systems of certain equations over finite fields, which were recently obtained by Fourier analytic methods. Roughly speaking, we show that almost all systems of norm, bilinear or quadratic equations over finite fields are solvable in any large subset of vector spaces over finite fields.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
18
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 19 publications
(19 citation statements)
references
References 34 publications
1
18
0
Order By: Relevance
“…We provide a proof of Lemma 2.3 for completeness in the appendix, and we note that similar lemmas were proved in [11] and [10].…”
Section: Sum-product Graphsmentioning
confidence: 72%
“…We provide a proof of Lemma 2.3 for completeness in the appendix, and we note that similar lemmas were proved in [11] and [10].…”
Section: Sum-product Graphsmentioning
confidence: 72%
“…It is clear that the graph SP(F d+1 q ) is a q d -graph of order q d+1 . The following lemma was proved by Vinh [20] . For each x = (x 1 , .…”
Section: Additive Energy Estimatesmentioning
confidence: 92%
“…Several more interesting results in this direction have been given by Hegyvári [121,122] and Vinh [198,201,205,206].…”
Section: Theorem 312 For Any Two Setsmentioning
confidence: 96%
“…Furthermore, Schoen & Shkredov [167] have successfully used a "cubic" generalization of the energy. We also have had to leave out such exciting areas of additive combinatorics in finite fields as • the Erdős distance problem [83,94,117,130,132,144,145] as well as its modification in some other settings (distinct volumes, configurations, and so on defined by arbitrary sets in F n q ) and metrics [14,64,142,195,200,202,203,205]; • the Kakeya problem and other related problems about the directions defined by arbitrary sets in vector spaces over a finite field, see [84-86, 88, 128, 131, 151]; • estimating the size of the sets in a finite field that avoid arithmetic or geometric progressions, sum sets and similar linear and non-linear relations; in particular these results include finite field analogues of the Roth and Szemerédi theorems, see [1,6,8,12,77,81,112,113,153,154,158,181]; • estimating the size of the sets in vector spaces over a finite field that define only some restrictive geometric configurations such as integral distances, acute angles, and pairwise orthogonal systems, see [75,133,134,183,194,204]; • distribution of the values of determinants and permanents of matrices with entries from general sets, see [74,196,197]; and several others.…”
Section: Introductionmentioning
confidence: 99%