A remark on B₂k-sequences
From MaRDI portal
Publication:1340273
Improving a result of \textit{S. Chen} [Acta Arith. 64, 325-330 (1993; Zbl 0781.11010)], the author proves that any set \(A\) of integers such that all the \(2k\)-fold sums of elements of \(A\) are distinct satisfies \[ \liminf A(n) n^{-1/ (2k)} (\log n)^{-1/ (3k-1)} <\infty. \] (For odd numbers still no comparable estimate is known.).
Recommendations
- A note on \(B_{2k}\) sequences
- On \(B_{2k}\)-sequences
- On $B_{2k}$-sequences
- A remark on B₂-sequences in GF[p,x]
- Some remarks on \(B_ h[g]\) sequences
- An upper bound for \(B_2 [2]\) sequences
- scientific article; zbMATH DE number 1117707
- An inequality for B2-sequences
- B₂-sequences and the distinct distance constant
- scientific article; zbMATH DE number 4073115
Cited in
(7)- Some remarks on \(B_ h[g]\) sequences
- A note on \(B_{2k}\) sequences
- Minimum-weight edge discriminators in hypergraphs
- On $B_{2k}$-sequences
- scientific article; zbMATH DE number 2109756 (Why is no real title available?)
- A new lower bound for the distinct distance constant
- New upper bounds for finite \(B_h\) sequences
This page was built for publication: A remark on \(B_{2k}\)-sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340273)
