Cameron has introduced a natural one-to-one correspondence between infinite binary se-quences and sets of positive integers with the property that no two elements add up to a third. He observed that, if a sum-free set is ultimately periodic, so is the corresponding binary sequence, and asked if the converse also holds. We introduce the concept of difference density and show how this can be used to test specific sets. These tests produce further evidence of a positive nature that certain sets are, in fact, not ultimately periodic. 1
28 pagesWe give new combinatorial proofs of known almost-periodicity results for sumsets of sets wit...
AbstractThis paper deals with the problem of finding the maximal density μ(M) of sets of integers in...
Abstract. It is a striking and elegant fact (proved independently by Furstenberg and Sárközy) that...
Cameron has introduced a natural one-to-one correspondence between infinite binary sequences and set...
AbstractThis paper deals with the following problem posed by Professor T. S. Motzkin: Suppose M is a...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
An arithmetic progression is a sequence of numbers such that the difference between the consecutive ...
AbstractThe aim of this paper is to study the maximal density attainable by a sequence S of positive...
International audienceCobham's theorem asserts that if a sequence is automatic with respect to two m...
AbstractErdős and Sárkőzy proposed the problem of determining the maximal density attainable by a se...
AbstractThe maximal density attainable by a sequence S of positive integers having the property that...
AbstractA subset of the natural numbers isk-sum-free if it contains no solutions of the equationx1+…...
Separating Bohr denseness from measurable recurrence, Discrete Analysis 2021:9, 20 pp. This paper i...
In this paper, we consider sets of natural numbers P ⊆ N = {0, 1, 2, 3,...} which satisfy the proper...
AbstractA subset A of integers is said to be sum-free if a+b∉A for any a,b∈A. Let s(n) be the number...
28 pagesWe give new combinatorial proofs of known almost-periodicity results for sumsets of sets wit...
AbstractThis paper deals with the problem of finding the maximal density μ(M) of sets of integers in...
Abstract. It is a striking and elegant fact (proved independently by Furstenberg and Sárközy) that...
Cameron has introduced a natural one-to-one correspondence between infinite binary sequences and set...
AbstractThis paper deals with the following problem posed by Professor T. S. Motzkin: Suppose M is a...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
An arithmetic progression is a sequence of numbers such that the difference between the consecutive ...
AbstractThe aim of this paper is to study the maximal density attainable by a sequence S of positive...
International audienceCobham's theorem asserts that if a sequence is automatic with respect to two m...
AbstractErdős and Sárkőzy proposed the problem of determining the maximal density attainable by a se...
AbstractThe maximal density attainable by a sequence S of positive integers having the property that...
AbstractA subset of the natural numbers isk-sum-free if it contains no solutions of the equationx1+…...
Separating Bohr denseness from measurable recurrence, Discrete Analysis 2021:9, 20 pp. This paper i...
In this paper, we consider sets of natural numbers P ⊆ N = {0, 1, 2, 3,...} which satisfy the proper...
AbstractA subset A of integers is said to be sum-free if a+b∉A for any a,b∈A. Let s(n) be the number...
28 pagesWe give new combinatorial proofs of known almost-periodicity results for sumsets of sets wit...
AbstractThis paper deals with the problem of finding the maximal density μ(M) of sets of integers in...
Abstract. It is a striking and elegant fact (proved independently by Furstenberg and Sárközy) that...