A greedy algorithm for Bh[g] sequences
Abstract
For any positive integers h 2 and g 1, we present a greedy algorithm that provides an infinite Bh[g] sequence with an 2gnh+(h-1)/g.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.