An improved lower bound for finite additive 2-bases

DOI10.1016/j.jnt.2016.11.011zbMath1359.11013arXiv1606.04770OpenAlexW2428137983MaRDI QIDQ503745

Jukka Kohonen

Publication date: 23 January 2017

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.04770

zbMATH Keywords

lower boundfinite additive basis

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13)

Related Items (2)

Finite Representability of Integers as $2$-Sums ⋮ Planar additive bases for rectangles

Cites Work

• Untere Schranken für die Reichweiten von Extremalbasen fester Ordnung
• A new upper bound for finite additive \(h\)-bases
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
• Algorithms for Computing the h-Range of the Postage Stamp Problem
• Addition Chains Meet Postage Stamps: Reducing the Number of Multiplications

This page was built for publication: An improved lower bound for finite additive 2-bases