Abstract:Let F p be a prime field of order p > 2, and A be a set in F p with very small size in terms of p. In this note, we show that the number of distinct cubic distances determined by points in A × A satisfieswhich improves a result due to Yazici, Murphy, Rudnev, and Shkredov. In addition, we investigate some new families of expanders in four and five variables. We also give an explicit exponent of a problem of Bukh and Tsimerman, namely, we prove thatthat is not of the form g(αx + βy) for some univariate polynomia… Show more
“…We require the following claim, when applying Lemmas 4 and 6. A proof can be found inside the proof of [5,Theorem 1.10].…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…Another variation of the sum-product problem, which encodes both forms discussed above, is to consider the growth of |A+A|+|f (A, A)| for some bivariate function f . See for example [2], [5], [9] and [19] for results in this direction. Note that if f = g(ax + by) for some polynomial g, then taking A to be an arithmetic progression, one has |A + A| ≈ |f (A, A)| ≈ |A|.…”
We prove analogues of a low-energy decomposition theorem of Roche-Newton, Shparlinski, and Winterhof for small subsets of finite fields of prime order. In particular, motivated by a question of the same authors, we generalize a result of Rudnev, Shkredov, and Stevens by replacing the notion of multiplicative energy with the number of solutions to equations of the form f (x 1 , x 2 ) = f (x 3 , x 4 ) for bivariate quadratic polynomials f . As an application, we prove a variant of an estimate of Swaenepoel and Winterhof on bilinear character sums that leads to quantitative improvements over a certain range of sets.
“…We require the following claim, when applying Lemmas 4 and 6. A proof can be found inside the proof of [5,Theorem 1.10].…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…Another variation of the sum-product problem, which encodes both forms discussed above, is to consider the growth of |A+A|+|f (A, A)| for some bivariate function f . See for example [2], [5], [9] and [19] for results in this direction. Note that if f = g(ax + by) for some polynomial g, then taking A to be an arithmetic progression, one has |A + A| ≈ |f (A, A)| ≈ |A|.…”
We prove analogues of a low-energy decomposition theorem of Roche-Newton, Shparlinski, and Winterhof for small subsets of finite fields of prime order. In particular, motivated by a question of the same authors, we generalize a result of Rudnev, Shkredov, and Stevens by replacing the notion of multiplicative energy with the number of solutions to equations of the form f (x 1 , x 2 ) = f (x 3 , x 4 ) for bivariate quadratic polynomials f . As an application, we prove a variant of an estimate of Swaenepoel and Winterhof on bilinear character sums that leads to quantitative improvements over a certain range of sets.
“…For more variables polynomials, it is expectable to have bigger exponents. For instance, (x − y)(z − t) with ǫ = 1 3 + 1 13542 in [22], xy + (z − t) 2 with ǫ = 1 3 + 1 24 in [35], many other examples can also be found in [20,34].…”
Let f ∈ R[x, y, z] be a quadratic polynomial that depends on each variable and that does not have the form g(h(x)+k(y)+l(z)). Let A, B, C be compact sets in R. Suppose that dim H (A)+dim H (B)+dim H (C) > 2, then we prove that the image set f (A, B, C) is of positive Lebesgue measure. Our proof is based on a result due to Eswarathasan, Iosevich, and Taylor (Advances in Mathematics, 2011), and a combinatorial argument from the finite field model.
“…In a recent work, a very general bound for quadratic polynomials has been given by Koh, Mojarrad, Pham, and Valculescu [7].…”
Section: Introductionmentioning
confidence: 99%
“…Theorem 1.5 (Koh-Mojarrad-Pham-Valculescu, [7]). Let F p be a prime field of order p, and let f (x, y) ∈ F p [x, y] be a non-degenerate quadratic polynomial.…”
Let F p be a prime field of order p, and A be a set in F p with |A| ≤ p 1/2 . In this note, we show that max{|A + A|, |f (A, A)|} |A| 6 5 + 4 305 , where f (x, y) is a non-degenerate quadratic polynomial in F p [x, y]. This improves a recent result given by Koh, Mojarrad, Pham, Valculescu (2018).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.