An explicit finite Bk-sequence

Abstract

For any n and k, we provide an explicit (that is, computable in polynomial time) example of integer Bk-sequence of size n consisting of elements bounded by nk+o(k).

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…