Let be a sequence with a finite number of terms equal to 1. The distance sequence of is defined as a sequence of the numbers of -couples of given distances. The paper investigates such pairs of sequences that a is different from and .
Given a set A ⊂ ℕ let denote the number of ordered pairs (a,a’) ∈ A × A such that a + a’ = n. Erdős and Turán conjectured that for any asymptotic basis A of ℕ, is unbounded. We show that the analogue of the Erdős-Turán conjecture does not hold in the abelian group (ℤₘ,+), namely, for any natural number m, there exists a set A ⊆ ℤₘ such that A + A = ℤₘ and for all n̅ ∈ ℤₘ.
Let , where n ∈ N and A is a subset of N. Erdős and Turán conjectured that for any basis A of order 2 of N, is unbounded. In 1990, Imre Z. Ruzsa constructed a basis A of order 2 of N for which is bounded in the square mean. In this paper, we show that there exists a positive integer m₀ such that, for any integer m ≥ m₀, we have a set A ⊂ Zₘ such that A + A = Zₘ and for all n̅ ∈ Zₘ.
Let G be an additive abelian group of order k, and S be a sequence over G of length k+r, where 1 ≤ r ≤ k-1. We call the sum of k terms of S a k-sum. We show that if 0 is not a k-sum, then the number of k-sums is at least r+2 except for S containing only two distinct elements, in which case the number of k-sums equals r+1. This result improves the Bollobás-Leader theorem, which states that there are at least r+1 k-sums if 0 is not a k-sum.