Abstract
We study extremal problems about sets of integers that do not contain sumsets with summands of prescribed size. We analyse both finite sets and infinite sequences. We also study the connections of these problems with extremal problems of graphs and hypergraphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Ajtai, J. Komlós and E. Szemerédi: A dense infinite Sidon sequence, European J. Combin. 2 (1981), 1–11.
N. Alon, L. Rónyai and T. Szabó: Norm-graphs: variations and applications, J. Combin. Theory Ser. B 76 (1999), no. 2, 280–290.
S. Ball and V. Pepe: Asymptotic improvements to the lower bound of certain bipartite Turán numbers, Combin. Probab. Comput. 21 (2012), 323–329.
F. Behrend: A. On sets of integers which contain no three terms in arithmetical progression, Proc. Nat. Acad. Sci. U. S. A. 32, (1946), 331–332.
W. G. Brown: On graphs that do not contain a Thomsen graph, Canad. Math. Bull. 9 (1966), 281–285.
J. Cilleruelo: Sidon sets in Nd, J. Combin. Theory Ser. A 117 (2010), 857–871.
J. Cilleruelo: Infinite Sidon sequences, Adv. Math. 255 (2014), 474–486.
J. Cilleruelo and G. Tenenbaum: An overlapping theorem with applications, Publ. Mat. 2007, Proceedings of the Primeras Jornadas de Teoría de Numeros, 107–118.
P. Erdős: On extremal problems of graphs and generalized graphs, Israel J. Math. 2 (1964), 183–190.
P. Erdős and E. Harzheim: Congruent subsets of infinite sets of natural numbers, J. Reine Angew. Math. 367 (1986), 207–214.
P. Erdős and A. Rényi: Additive properties of random sequences of positive integers, Acta Arith. 6 (1960), 83–110.
P. Erdős, A. Rényi and V. Sós: On a problem of graph theory, Studia Sci. Math. Hungar. 1 (1966), 215–235.
P. Erdős and M. Simonovits: Supersaturated graphs and hypergraphs, Combinatorica 3 (1983), 181–192.
P. Erdős and P. Turán: On a problem of Sidon in additive number theory, and on some related problems, J. London Math. Soc. 16 (1941), 212–215.
Z. Füredi: An upper bound on Zarankiewicz’ problem, Combin. Probab. Comput. 5 (1996), 29–33.
Z. Füredi, M. Simonovits: The history of degenerate (bipartite) extremal graph problems, Erdős centennial, 169–264, Bolyai Soc. Math. Stud., 25, János Bolyai Math. Soc., Budapest, 2013.
D. S. Gunderson and V. Rödl: Extremal problems for affine cubes of integers, Combin. Probab. Comput. 7 (1998), 65–79.
N. Katz, E. Krop and M. Maggioni: Remarks on the box problem, Math. Res. Lett. 9 (2002), 515–519.
T Kövari, V T Sós, P. Turán: On a problem of K. Zarankiewicz, Colloquium Math. 3 (1954), 50–57.
A. Lewko and M. Lewko: On the structure of sets of large doubling, European J. Combin. 32 (2011), 688–708.
B. Lindström: An inequality for B2-sequences, J. Combinatorial Theory 6 (1969), 211–212.
X. Peng, R. Tesoro and C. Timmons: Bounds for generalized Sidon sets, Discrete Math. 338 (2015), 183–190.
I. Ruzsa: Solving a linear equation in a set of integers. I, Acta Arith. 65 (1993), 259–282.
I. Ruzsa: An infinite Sidon sequence, J. Number Theory 68 (1998), 63–71.
Cs. Sándor: An upper bound for Hilbert cubes, J. Combin. Theory Ser. A 114 (2007), 1157–1159.
A. Stohr: Gelöste und ungelste Fragen der Basen der natürlichen Zahlenreihe,I,II, J. Reine Angew. Math. 194 (1955), 40–65, 111–140.
C. Trujillo, G. García and J. M. Velásquez: B ±2 2 [g] finite sets, J. Algebra Number Theory Appl. 4 (2004), 593–604.
Author information
Authors and Affiliations
Corresponding author
Additional information
Javier Cilleruelo passed away on May 15, 2016.
This work has been supported by MINECO project MTM2014-56350-P and ICMAT Severo Ochoa project SEV-2011-0087.
Rights and permissions
About this article
Cite this article
Cilleruelo, J., Tesoro, R. On Sets Free of Sumsets with Summands of Prescribed Size. Combinatorica 38, 511–546 (2018). https://doi.org/10.1007/s00493-016-3444-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-016-3444-4