On the order of a minimal additive basis (Q1273711): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimal asymptotic bases for the natural numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3949134 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5515488 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ein Beitrag zur Theorie der Minimalbasen. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal bases and maximal nonbases in additive number theory / rank | |||
Normal rank |
Latest revision as of 17:48, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the order of a minimal additive basis |
scientific article |
Statements
On the order of a minimal additive basis (English)
0 references
16 August 1999
0 references
Let \(A\) be a set of non-negative integers. If every sufficiently large integer is the sum of \(h\) (not necessarily distinct) elements of \(A\), then \(A\) is said to be an asymptotic \(h\)-basis. If no proper subset of \(A\) is an asymptotic basis, then \(A\) is said to be minimal. \textit{P. Erdős} and \textit{M. B. Nathanson} [J. Number Theory 12, 154-159 (1980; Zbl 0426.10057)] proved that minimal asymptotic bases exist. They also asked if a set could be simultaneously an minimal asymptotic \(h\)-basis and a minimal asymptotic \(k\)-basis when \(h\) and \(k\) are integers with \(2\leq h < k\), and they proved that no such sets exist when \(h=2\) and \(k=4.\) In this article, the author gives a clever argument that generalizes the Erdős-Nathanson result; he proves that no such set can exist when \(h=2k\).
0 references
minimal additive bases
0 references
asymptotic basis
0 references