A greedy algorithm for B_h[g] sequences
classification
🧮 math.CO
math.NT
keywords
algorithmgreedyinfiniteintegerspositiveprovidessequencesequences
read the original abstract
For any positive integers $h\ge 2$ and $g\ge 1$, we present a greedy algorithm that provides an infinite $B_h[g]$ sequence with $a_n\le 2gn^{h+(h-1)/g}.$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.