English

An explicit finite $B_k$-sequence

Combinatorics 2023-04-11 v1

Abstract

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

Keywords

Cite

@article{arxiv.2304.03988,
  title  = {An explicit finite $B_k$-sequence},
  author = {Igor S. Sergeev},
  journal= {arXiv preprint arXiv:2304.03988},
  year   = {2023}
}

Comments

4 pages

R2 v1 2026-06-28T09:55:24.247Z