A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases

MaRDI QIDQ2877897zbMATH OpenFDO

Authors Jukka Kohonen

Publication date 28 August 2014

Published in Journal of Integer Sequences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.5945, http://www.emis.de/journals/JIS/VOL17/Kohonen2/kohonen5.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

additive basisrestricted basis

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13)

Abstract: An additive 2-basis with range n is restricted if its largest element is n/2. Among the restricted 2-bases of given length k, the ones that have the greatest range are extremal restricted. We describe an algorithm that finds the extremal restricted 2-bases of a given length, and we list them for lengths up to k = 41.

Recommendations

• Upper bounds for finite additive $2$-bases
• An improved lower bound for finite additive 2-bases
• Two New Techniques for Computing Extremal h-bases Ak
• scientific article; zbMATH DE number 493642
• scientific article; zbMATH DE number 1908107

Cited in

(2)

• Planar additive bases for rectangles
• Topics in Banach Space Theory

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A meet-in-the-middle algorithm for finding extremal restricted additive 2-bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2877897)