On a question of Erdős and Moser

@article{Sudakov2005OnAQ,
  title={On a question of Erdős and Moser},
  author={Benny Sudakov and Endre Szemer{\'e}di and Van H. Vu},
  journal={Duke Mathematical Journal},
  year={2005},
  volume={129},
  pages={129-155}
}
For two finite sets of real numbers A and B, one says that B is sum-free with respect to A if the sum set {b + b | b, b ∈ B, b 6= b} is disjoint from A. Forty years ago, Erdős and Moser posed the following question. Let A be a set of n real numbers. What is the size of the largest subset B of A which is sum-free with respect to A? In this paper, we show that any set A of n real numbers contains a set B of cardinality at least g(n) ln n which is sum-free with respect to A, where g(n) tends to… 

Sumfree sets in groups: a survey

We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in

Sums and products along sparse graphs

TLDR
This work considers sum-product theorems for sparse graphs, and shows that this problem has important consequences already when G is a matching, and gives lower and upper bounds for this problem in different settings.

Additive problems in abelian groups

In this thesis we shall present some results concerning additive properties of finite sets in abelian groups. It will be of primary importance to us to consider the sumsets A+B = {a+ b : a ∈ A, b ∈

Products of differences in arbitrary fields 1 Introduction 1 . 1 Overview

There exists an absolute constant δ > 0 such that for all q and all subsets A ⊆ Fq of the finite field with q elements, if |A| > q2/3−δ , then |(A−A)(A−A)| = |{(a− b)(c − d) : a, b, c, d ∈ A}| > q 2

On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets

  • Jehanne Dousse
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 2013
Abstract We prove a generalisation of Roth's theorem for arithmetic progressions to d-configurations, which are sets of the form {ni+nj+a}1 ≤ i ≤ j ≤ d with a, n1,. . .,nd ∈ $\mathbb{N}$, using

Finding Linear Patterns of Complexity One

We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct

The Erdős–Moser Sum-free Set Problem

  • T. Sanders
  • Mathematics
    Canadian Journal of Mathematics
  • 2019
Abstract We show that there is an absolute $c>0$ such that if $A$ is a finite set of integers, then there is a set $S\subset A$ of size at least $\log ^{1+c}|A|$ such that the restricted sumset

Clustered Integer 3SUM via Additive Combinatorics

TLDR
A collection of new results on problems related to 3SUM are presented, including the first truly subquadratic algorithm for computing the (min,+) convolution for monotone increasing sequences with integer values bounded by O(n), and preprocessing a binary string for histogram indexing (also called jumbled indexing).

Tight Lower Bounds for 2-query LCCs over Finite Fields

TLDR
This work proves a lower bound of the form p^{Ω(δd)} on the length of linear 2-query LCCs over $\F_p$, that encode messages of length d that improve over the known bound of $2^{ Ω (άd)} which is tight for LDCs.

Quadratic Goldreich-Levin Theorems

  • Madhur TulsianiJ. Wolf
  • Computer Science, Mathematics
    2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
  • 2011
TLDR
Algorithmic versions of results from additive combinatorics used in Samorodnitsky's proof and a refined version of the inverse theorem for the Gowers $U^3$ norm over $\F_2^n$ or a function at distance 1/2 -- episilon from a codeword are given.

References

SHOWING 1-10 OF 22 REFERENCES

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets

TLDR
Simple randomized algorithms leading to new upper bounds for combinatorial problems of Choi and Erdos are given and the methodical innovation of the whole approach is the use of large Sidon sets.

On a Combinatorial Problem in Number Theory

1. Introduction One of the problems mentioned injl] (on p. 187) concerns the estimation of the magnitude of the largest number g(N) such that, from every sequence of N distinct natural numbers, one

A polynomial bound in Freiman's theorem

.Earlier bounds involved exponential dependence in αin the second estimate. Ourargument combines I. Ruzsa’s method, which we improve in several places, as well asY. Bilu’s proof of Freiman’s

On sets of integers containing k elements in arithmetic progression

In 1926 van der Waerden [13] proved the following startling theorem : If the set of integers is arbitrarily partitioned into two classes then at least one class contains arbitrarily long arithmetic

Extremal Problems in Number Theory

I would like to illustrate the problems which I shall investigate in this paper by an example. Denote by r&z) the maximum number of integers not exceeding n, no k of which form an arithmetic

On sums and products of integers

. Erd¨os and Szemer(cid:19)edi proved that if A is a set of k positive integers, then there must be at least ck 1+ δ integers that can be written as the sum or product of two elements of A , where c

Finite and infinite arithmetic progressions in sumsets

We prove that if A is a subset of at least cn1/2 elements of {1, . . . , n}, where c is a sufficiently large constant, then the collection of subset sums of A contains an arithmetic progression of

A new proof of Szemerédi's theorem

In 1927 van der Waerden published his celebrated theorem on arithmetic progressions, which states that if the positive integers are partitioned into finitely many classes, then at least one of these

On sums and products of integers

Let 1 ≦ a 1 <... <a n be a sequence of integers Consider the integers of the form $$a_i + a_j ,\,a_i a_j ,\,1 \leqq i \leqq j \leqq n.$$ (1)

Unsolved problems in number theory

TLDR
The topics covered are: additive representation functions, the Erdős-Fuchs theorem, multiplicative problems (involving general sequences), additive and multiplicative Sidon sets, hybrid problems (i.e., problems involving both special and general sequences, arithmetic functions and the greatest prime factor func- tion and mixed problems.