A greedy algorithm for \(B_h[g]\) sequences
From MaRDI portal
Publication:2397112
DOI10.1016/j.jcta.2017.03.010zbMath1384.11015arXiv1601.00928OpenAlexW2597960029MaRDI QIDQ2397112
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
greedy algorithmSidon sequences\(B_h [g\) sequences]
Related Items
Cites Work
- Unnamed Item
- A dense infinite Sidon sequence
- An infinite Sidon sequence
- Probabilistic constructions of \(B_2[g\) sequences]
- Dense infinite \(B_h\) sequences
- Infinite Sidon sequences
- Generalization of a theorem of Erdős and Rényi on Sidon sequences
- Additive properties of random sequences of positive integers
- Concentration of multivariate polynomials and its applications