A numerical note on upper bounds for B₂[g] sets
From MaRDI portal
Publication:4643735
DOI10.1080/10586458.2016.1245640zbMATH Open1416.11016arXiv1609.02771OpenAlexW2519534064MaRDI QIDQ4643735FDOQ4643735
Authors: Laurent Habsieger, Alain Plagne
Publication date: 28 May 2018
Published in: Experimental Mathematics (Search for Journal in Brave)
Abstract: Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a satisfactory way. Their natural generalization, called B 2 [g] sets and defined by the fact that there are at most g ways (up to reordering the summands) to represent a given integer as a sum of two elements of the set, are much more difficult to handle and not as well understood. In this article, using a numerical approach, we improve the best upper estimates on the size of a B 2 [g] set in an interval of integers in the cases g = 2, 3, 4 and 5.
Full work available at URL: https://arxiv.org/abs/1609.02771
Recommendations
Other combinatorial number theory (11B75) Representation functions (11B34) Inverse problems of additive number theory, including sumsets (11P70)
Cites Work
- Title not available (Why is that?)
- Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen
- The number of squares and \(B_h[g]\) sets
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- Title not available (Why is that?)
- An upper bound for \(B_{2}[g]\) sets
- Constructions of generalized Sidon sets.
- Upper and lower bounds for finite \(B_h[g]\) sequences.
- \(B_2[2]\): The vise tightens
- Title not available (Why is that?)
- On finite additive \(2\)-bases
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- An Upper Bound for Weak $B_k$-Sets
- A new upper bound for \(B_2 [2]\) sets
- Title not available (Why is that?)
- An upper bound for \(B_{2}[g]\) sets
- Title not available (Why is that?)
- The number of squares and \(B_h[g]\) sets
- B2[g] Sets and a Conjecture of Schinzel and Schmidt
Uses Software
This page was built for publication: A numerical note on upper bounds for \(B_2[g]\) sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643735)