2000 character limit reached
On universal sets and sumsets
Published 1 Apr 2024 in math.CO and math.NT | (2404.01529v1)
Abstract: We study the concept of universal sets from the additive--combinatorial point of view. Among other results we obtain some applications of this type of uniformity to sets avoiding solutions to linear equations, and get an optimal upper bound for the covering number of general sumsets.
- N. Alon. Large sets in finite fields are sumsets. Journal of Number Theory, 126(1):110–118, 2007.
- Discrete Kakeya-type problems and small bases. Israel Journal of Mathematics, 174(1):285–301, 2009.
- T. F. Bloom and O. Sisask. An improvement to the Kelley-Meka bounds on three-term arithmetic progressions. arXiv preprint arXiv:2309.02353, 2023.
- On covering by translates of a set. Random Structures & Algorithms, 38(1-2):33–67, 2011.
- E. Croot. Some properties of lower level-sets of convolutions. Combinatorics, Probability and Computing, 21(4):515–530, 2012.
- Arithmetic progressions in sparse sumsets. Combinatorial Number Theory (Walter de Gruyter, Berlin, 2007), pages 157–164, 2007.
- H. Furstenberg. Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions. Journal d’Analyse Mathématique, 31(1):204–256, 1977.
- D. Gijswijt. Excluding affine configurations over a finite field. Discrete Analysis, 2023.
- N. H. Katz and P. Koester. On additive doubling and energy. SIAM Journal on Discrete Mathematics, 24(4):1684–1693, 2010.
- Z. Kelley and R. Meka. Strong bounds for 3-progressions. arXiv preprint arXiv:2302.05537, 2023.
- S. V. Konyagin. On the Littlewood problem. Izv. Akad. Nauk SSSR Ser. Mat, 45(2):243–265, 1981.
- Kakeya-type sets in finite vector spaces. Journal of Algebraic Combinatorics, 34:337–355, 2011.
- T. Kosciuszko. Counting solutions to invariant equations in dense sets. arXiv preprint arXiv:2306.08567, 2023.
- Hardy’s inequality and the L1 norm of exponential sums. Annals of Mathematics, pages 613–618, 1981.
- D. J. Newman. Complements of finite sets of integers. Michigan Mathematical Journal, 14(4):481–486, 1967.
- G. Petridis. New proofs of Plünnecke-type estimates for product sets in groups. Combinatorica, 32(6):721–733, 2012.
- C. A. Rogers. Packing and covering, volume 54. Cambridge University Press, New York, 1964.
- I. Ruzsa. An analog of Freiman’s theorem in groups. Astérisque, 258(199):323–326, 1999.
- I. Z. Ruzsa. An application of graph theory to additive number theory. Scientia, Ser. A, 3(97-109):9, 1989.
- W. M. Schmidt. Complementary sets of finite sets. Monatshefte für Mathematik, 138(1):61–71, 2003.
- T. Schoen. On convex equations. arXiv preprint arXiv:2310.09584, 2023.
- T. Schoen and I. D. Shkredov. Higher moments of convolutions. J. Number Theory, 133(5):1693–1737, 2013.
- T. Schoen and I. D. Shkredov. Additive dimension and a theorem of Sanders. J. Aust. Math. Soc., 100(1):124–144, 2016.
- A. Semchankau. A new bound for A(A+A)𝐴𝐴𝐴A(A+A)italic_A ( italic_A + italic_A ) for large sets. arXiv preprint arXiv:2011.11468, 2020.
- Number of A+B≠C𝐴𝐵𝐶A+B\neq Citalic_A + italic_B ≠ italic_C solutions in abelian groups and application to counting independent sets in hypergraphs. European Journal of Combinatorics, 100:103453, 2022.
- I. D. Shkredov. On some multiplicative properties of large difference sets. arXiv:2301.09206v1, 2023.
- C. L. Stewart and R. Tijdeman. On infinite-difference sets. Canadian Journal of Mathematics, 31(5):897–910, 1979.
- T. Tao and V. Vu. Additive combinatorics, volume 105 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2006.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.