5 citations · 16 across the 14 of their papers we have counts for
1 paper · 1 filter
Igor S. Sergeev
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).