论文信息 - Some Equivalents of the Erdös Sum of Reciprocals Conjecture

Some Equivalents of the Erdös Sum of Reciprocals Conjecture

The Erdos sum of reciprocals conjecture is the statement that whenever A is a set of positive integers and ∑∈ A 1/ x = ∞, A contains arbitrarily long arithmetic progressions. It is shown here that this conjecture is equivalent to each of several other statements. Some of these other statements are combinatorial in nature while others are topological-algebraic statements.

Neil Hindman

[1] The sum of the reciprocals of a set of integers with no arithmetic progression of $k$ terms , 1977 .

[2] Neil Hindman. On Density, Translates, and Pairwise Sums of Integers , 1982, J. Comb. Theory, Ser. A.

[3] Paul Erdös,et al. On Some Sequences of Integers , 1936 .

[4] E. Szemerédi. On sets of integers containing k elements in arithmetic progression , 1975 .

[5] W. Comfort,et al. Ultrafilters: Some old and some new results , 1977 .

[6] Neil Hindman. Ramsey's Theorem for Sums, Products, and Arithmetic Progressions , 1985, J. Comb. Theory, Ser. A.

[7] N. Hindman,et al. Filters and the weak almost periodic compactification of a discrete semigroup , 1984 .

[8] Joseph L. Gerver. Irregular sets of integers generated by the greedy algorithm , 1983 .

[9] Some Questions about Arithmetic Progressions , 1979 .

[10] P. Milnes,et al. Compact right topological semigroups and generalizations of almost periodicity , 1978 .

[11] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .

[12] Leo Moser,et al. On Non-Averaging Sets of Integers , 1953, Canadian Journal of Mathematics.

[13] Neil Hindman,et al. Ultrafilters and combinatorial number theory , 1979 .

[14] N. Hindman. Sums equal to products in βN , 1980 .