Hostname: page-component-cc8bf7c57-n7qbj Total loading time: 0 Render date: 2024-12-12T07:54:41.888Z Has data issue: false hasContentIssue false
  • English
  • Français

Blocks of consecutive integers in sumsets (A + B)t

Published online by Cambridge University Press:  17 April 2009

Shu-Guang Guo  and
Yong-Gao Chen
Shu-Guang Guo
Affiliation:
Department of Mathematics, Southeast University, Nanjing 210096, Jiangsu, Peoples Republic of China and Department of Mathematics, Yancheng Teachers College, Yancheng 224002, Jiangsu, Peoples Republic of China e-mail: ychgsg@163.com
Yong-Gao Chen
Affiliation:
Department of Mathematics, Nanjing Normal University, Nanjing 210097, Jiangsu, Peoples Republic of China e-mail: ygchen@njnu.edu.cn
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let A, B ⊆ {1, …, n}. For m ∈ Z, let rA,B(m) be the cardinality of the set of ordered pairs (a, b) ∈ A × B such that a + b = m. For t ≥ 1, denote by (A + B)t the set of the elements m for which rA, B(m) ≥ t. In this paper we prove that for any subsets A, B ⊆ {1, …, n} such that |A| + |B| ≥ (4n + 4t − 3)/3, the sumset (A + B)t contains a block of consecutive integers with the length at least |A| + |B| − 2t + 1, and that (a) for any two subsets A and B of {1, …, n} such that |A| + |B| ≥ (4n)/3, there exists an arithmetic progression of length n in A + B; (b) for any 2 ≤ r ≤ (4n − 1)/3, there exist two subsets A and B of {1, …, n} with |A| + |B| = r such that any arithmetic progression in A + B has the length at most (2n − 1)/3 + 1.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 70 , Issue 2 , October 2004 , pp. 283 - 291
Copyright
Copyright © Australian Mathematical Society 2004

References

[1]Caldeira, C. and da Silva, J.A. Dias, ‘A Pollard type result for restricted sums’, J. Number Theory 72 (1998), 153–173.CrossRefGoogle Scholar
[2]Caldeira, C. and da Silva, J.A. Dias, ‘The invariant polynomials degrees of the Kronecker sum of two linear operators and additive theory’, Linear Algebra Appl. 315 (2000), 125–138.CrossRefGoogle Scholar
[3]Hamidoune, Y.O., ‘The representation of some integers as a subset sum’, Bull. London Math. Soc. 26 (1994), 557–563.CrossRefGoogle Scholar
[4]Lev, V.F., ‘On consecutive subset sums’, Discrete Math. 187 (1998), 151–160.CrossRefGoogle Scholar
[5]Lev, V.F., ‘Blocks and progressions in subset sum sets’, Acta Arith 106 (2003), 123–142.CrossRefGoogle Scholar
[6]Nathanson, M.B., ‘Sumsets containing k – free integers’, in Number Theory (Ulm, 1987), Lecture Notes in Math. 1380 (Springer-Verlag, New York, 1989), pp. 179–184.CrossRefGoogle Scholar
[7]Nathanson, M.B., Additive number theory: inverse problems and the geometry of sumsets, Graduate Texts in Math. 165 (Springer-Verlag, New York 1996).CrossRefGoogle Scholar
[8]Pollard, J.M., ‘A generalization of a theorem of Cauchy and Davenport’, J. London Math. Soc. 8 (1974), 460–462.CrossRefGoogle Scholar
[9]Sárközy, A., ‘Finite addition theorems, II’, J. Number Theory 48 (1994), 197–218.CrossRefGoogle Scholar