A numerical note on upper bounds for B₂[g] sets

DOI10.1080/10586458.2016.1245640MaRDI QIDQ4643735zbMATH OpenOpenAlexFDO

Authors Laurent Habsieger, Alain Plagne

Publication date 28 May 2018

Published in Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Sidon setsnumerical approachupper bounds

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Representation functions (11B34) Inverse problems of additive number theory, including sumsets (11P70)

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.

Recommendations

• A new upper bound for \(B_2 [2]\) sets
• \(B_2[2]\): The vise tightens
• Constructions of generalized Sidon sets.
• An upper bound for \(B_{2}[g]\) sets
• Sidon Sets

Cites work

• scientific article; zbMATH DE number 5557913 (Why is no real title available?)
• scientific article; zbMATH DE number 1735723 (Why is no real title available?)
• scientific article; zbMATH DE number 3103352 (Why is no real title available?)
• scientific article; zbMATH DE number 3103684 (Why is no real title available?)
• An upper bound for \(B_{2}[g]\) sets
• Constructions of generalized Sidon sets.
• Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems
• On finite additive \(2\)-bases
• The number of squares and \(B_h[g]\) sets
• Upper and lower bounds for finite \(B_h[g]\) sequences.
• \(B_2[2]\): The vise tightens

Cited in

(8)

• scientific article; zbMATH DE number 3995052 (Why is no real title available?)
• An Upper Bound for Weak $B_k$-Sets
• A new upper bound for \(B_2 [2]\) sets
• An upper bound for \(B_{2}[g]\) sets
• scientific article; zbMATH DE number 2202725 (Why is no real title available?)
• scientific article; zbMATH DE number 5557913 (Why is no real title available?)
• The number of squares and \(B_h[g]\) sets
• B₂[g] Sets and a Conjecture of Schinzel and Schmidt

Describes a project that uses

Uses Software

• Maple

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)