Some remarks on multilinear exponential sums with an application (Q643535): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mordell’s exponential sum estimate revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilinear exponential sums in prime fields under optimal entropy condition on the sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a variant of sum-product estimates and explicit exponential sum bounds in prime fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems in finite fields and Sidon sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sum-product bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of extractors and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sums and products of residues modulo p / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE SOLVABILITY OF BILINEAR EQUATIONS IN FINITE FIELDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393666 / rank
 
Normal rank

Revision as of 14:07, 4 July 2024

scientific article
Language Label Description Also known as
English
Some remarks on multilinear exponential sums with an application
scientific article

    Statements

    Some remarks on multilinear exponential sums with an application (English)
    0 references
    0 references
    2 November 2011
    0 references
    Let \(\mathbb F_p\) be the prime field with multiplicative subgroup denoted by \(\mathbb F_p^*\). Then a well-known estimate (Vinogradov) for the double exponential sums is the following upper bound \[ \Bigl| \sum_{x\in X, y\in Y} e(xy)\Bigr| <\sqrt{p| X|\,| Y|}. \tag{0.1} \] \textit{A. Sárközy} [Acta Arith. 118, 403--409 (2005; Zbl 1078.11011)] applied (0.1) to prove that for \(A,B,C,D\in \mathbb F_p\) the equation \(a + b = cd\), \((a, b, c, d)\in A\times B\times C\times D\) has a solution, provided \(| A|\,| B|\,| C|\, | D| > p^3\). Recently, \textit{J. Bourgain} [Geom. Funct. Anal. 18(2008), No. 5, 1477--1502 (2009; Zbl 1162.11043)] proved a strong generalization of (0.1) by obtaining the following. Theorem 1. There is a constant \(C>1\) such that for every \(0 <\delta <1\) and \(r\in \mathbb N\), \(r > C/\delta\), if \(A_1,A_2,\ldots,A_r\subseteq \mathbb F_p, | A_i|> p^\delta\) for \(1\leq i\leq r\), \(p\) is a prime which is large enough, then \[ \Bigl| \sum_{x_1\in A_1,\ldots,x_r\in A_r} e(x_1x_2\cdots x_r)\Bigr| < p^{-\delta'} | A_1|\,| A_2|\, | A_r| \] where \(\delta' > C^{-r}\). Now in this paper the author shows that under some restriction for three sets of the collection of \(A_1,A_2\ldots,A_r\) one can obtain an explicit \(\delta'\) depending only on the ratio of the cardinalities of these given three sets. For this he improves a result of Sárközy.
    0 references
    multilinear exponential sums
    0 references
    sum-product problem
    0 references
    Sárközy type sum-product equations
    0 references

    Identifiers