An upper bound for the h-range of the postage stamp problem

DOI10.4064/AA-54-4-301-306MaRDI QIDQ3484904zbMATH OpenOpenAlexFDO

Authors Øystein J. Rødseth

Publication date 1990

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/206260

zbMATH Keywords

extremal h-rangepostage stamp problemReichweite

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Linear Diophantine equations (11D04)

Cited in

(9)

• Weighted multi-connected loop networks
• On Frobenius numbers for symmetric (not complete intersection) semigroups generated by four elements
• On the postage stamp problem with three stamp denominations, III.
• The Postage Stamp Problem: An algorithm to determine the h-range on the h-range formula on the extremal basis problem for k=4
• The postage stamp problem: The extremal basis for k=4
• Bounds on generalized Frobenius numbers
• An optimal lower bound for the Frobenius problem
• Frobenius problem for semigroups S(d₁,d₂,d₃).
• The asymptotic distribution of Frobenius numbers

This page was built for publication: An upper bound for the h-range of the postage stamp problem

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