The Symmetric Subset Problem in Continuous Ramsey Theory

DOI10.1080/10586458.2007.10128993zbMATH Open1209.05257arXivmath/0410004OpenAlexW2079224416MaRDI QIDQ3512342FDOQ3512342

Authors: Greg Martin, Kevin O'Bryant 

Publication date: 11 July 2008

Published in: Experimental Mathematics (Search for Journal in Brave)

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 $[0,1]$ 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.

Full work available at URL: https://arxiv.org/abs/math/0410004

Recommendations

• scientific article; zbMATH DE number 1498640
• Sidon Sets
• Ramsey functions for symmetric subsets in compact abelian groups
• Ramsey problems for spaces with symmetries
• On strong infinite Sidon and \(B_h\) sets and random sets of integers

zbMATH Keywords

Ramsey theorySidon setscontinuous combinatorics

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Ramsey theory (05D10) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16)

Cited In (12)

• Title not available (Why is that?)
• Three convolution inequalities on the real line with connections to additive combinatorics
• Upper and lower bounds on the size of \(B_k[g]\) sets
• A symmetrized metric Ramsey theorem
• Generalized Sidon sets
• On optimal autocorrelation inequalities on the real line
• Ramsey problems for spaces with symmetries
• The supremum of autoconvolutions, with applications to additive number theory
• B₂[g] Sets and a Conjecture of Schinzel and Schmidt
• Extensions of autocorrelation inequalities with applications to additive combinatorics
• Measures of pseudorandomness of finite binary lattices. II: The symmetry measures
• On suprema of autoconvolutions with an application to Sidon sets

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)