A greedy algorithm for B_h[g] sequences

DOI10.1016/J.JCTA.2017.03.010zbMATH Open1384.11015arXiv1601.00928OpenAlexW2597960029MaRDI QIDQ2397112FDOQ2397112

Javier Cilleruelo

Publication date: 29 May 2017

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

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}.$

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)

Cites Work

• Concentration of multivariate polynomials and its applications
• Additive properties of random sequences of positive integers
• A dense infinite Sidon sequence
• Probabilistic constructions of \(B_2[g]\) sequences
• An infinite Sidon sequence
• Infinite Sidon sequences
• Title not available (Why is that?)
• Generalization of a theorem of Erdős and Rényi on Sidon sequences
• Dense infinite \(B_h\) 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)