2019/11/27 by Konstantin Olmezov, Olmezov, Konstantin I., Aliaksei Semchankau +3 · 1 citation
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Graph Labeling and Dimension Problems #Advanced Graph Theory Research
paper · pdf · doi:10.48550/arxiv.1911.12005
Given a subset of real numbers A with small product AA we obtain a new upper bound for the additive energy of A. The proof uses a natural observation that level sets of convolutions of the characteristic function of A have small product with A.