The Symmetric Subset Problem in Continuous Ramsey Theory
From MaRDI portal
Publication:3512342
Abstract: A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of with measure greater than x contains a symmetric subset with measure D(x). In this paper we establish upper and lower bounds for D(x) of the same order of magnitude: for example, we prove that D(x) = 2x - 1 for 11/16 <= x <= 1 and that 0.59 x^2 < D(x) < 0.8 x^2 for 0 < x <= 11/16. This continuous problem is intimately connected with a corresponding discrete problem. A set S of integers is called a B*[g] set if for any given m there are at most g ordered pairs (s_1,s_2) in S imes S with s_1+s_2 = m; in the case g=2, these are better known as Sidon sets. Our lower bound on D(x) implies that every B*[g] set contained in {1,2,...,n} has cardinality less than 1.30036 sqrt{gn}. This improves a result of Green for g >= 30. Conversely, we use a probabilistic construction of B*[g] sets to establish an upper bound on D(x) for small x.
Recommendations
Cited in
(12)- Upper and lower bounds on the size of \(B_k[g]\) sets
- Three convolution inequalities on the real line with connections to additive combinatorics
- The supremum of autoconvolutions, with applications to additive number theory
- Ramsey problems for spaces with symmetries
- B2[g] Sets and a Conjecture of Schinzel and Schmidt
- On suprema of autoconvolutions with an application to Sidon sets
- On optimal autocorrelation inequalities on the real line
- Generalized Sidon sets
- scientific article; zbMATH DE number 5520320 (Why is no real title available?)
- A symmetrized metric Ramsey theorem
- Extensions of autocorrelation inequalities with applications to additive combinatorics
- Measures of pseudorandomness of finite binary lattices. II: The symmetry measures
This page was built for publication: The Symmetric Subset Problem in Continuous Ramsey Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512342)