A greedy algorithm for B_h[g] sequences

DOI10.1016/J.JCTA.2017.03.010MaRDI QIDQ2397112zbMATH OpenOpenAlexFDO

Authors Javier Cilleruelo

Publication date 29 May 2017

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

greedy algorithmSidon sequences\(B_h [g\) sequences]

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Special sequences (11K31)

Abstract: For any positive integers $hge2$ and $gge1$, we present a greedy algorithm that provides an infinite $B_h[g]$ sequence with $a_{n}le2g{n}^{h+(h-1)/g}.$

Cites work

• scientific article; zbMATH DE number 3763932 (Why is no real title available?)
• A dense infinite Sidon sequence
• Additive properties of random sequences of positive integers
• An infinite Sidon sequence
• Concentration of multivariate polynomials and its applications
• Dense infinite \(B_h\) sequences
• Generalization of a theorem of Erdős and Rényi on Sidon sequences
• Infinite Sidon sequences
• Probabilistic constructions of \(B_2[g]\) sequences

Cited in

(2)

• A relation between sequences generated by Golomb's preference algorithm
• Dense sumsets of Sidon sequences

This page was built for publication: A greedy algorithm for \(B_h[g]\) sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397112)