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 Edit this on Wikidata


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




Cites Work


Cited In (8)

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)