• Corpus ID: 119302564

On sum-product bases

@article{Hennecart2019OnSB,
  title={On sum-product bases},
  author={François Hennecart and Gyan Prakash and Eyyunni Pramod},
  journal={arXiv: Number Theory},
  year={2019}
}
Besides various asymptotic results on the concept of sum-product bases in $\mathbb{N}_0$, we consider by probabilistic arguments the existence of thin sets $A,A'$ of integers such that $AA+A=\mathbb{N}_0$ and $A'A'+A'A'=\mathbb{N}_0$. 

References

SHOWING 1-8 OF 8 REFERENCES
MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
In this paper we establish new estimates on sum-product sets and certain exponential sums in finite fields of prime order. Our first result is an extension of the sum-product theorem from [8] when
Multiplicative Bases and an Erdős Problem
In this paper we investigate how small the density of a multiplicative basis of order h can be in {1,2,...,n} and in ℤ+. Furthermore, a related problem of Erdős is also studied: How dense can a set
A note on the size of the set $$\varvec{A^2+A}$$A2+A
Let $$F(x,y,z)=xy+z$$F(x,y,z)=xy+z. We consider some properties of expansion of the polynomial F in different settings, namely in the integers and in prime fields. The main results concern the
Additive combinatorics
  • T. Tao, V. Vu
  • Mathematics
    Cambridge studies in advanced mathematics
  • 2007
TLDR
The circle method is introduced, which is a nice application of Fourier analytic techniques to additive problems and its other applications: Vinogradov without GRH, partitions, Waring’s problem.
Explicit constructions of extractors and expanders
We investigate 2-variable expanders and 3-source extractors in prime fields. We extend previous results of J. Bourgain.
On the additive completion of primes
A note on the size of the set A 2 + A
  • Acta Arith .
  • 2009