Erweiterung dreielementiger Basen bei konstanter Frobeniuszahl. (Q3342669)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3875406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Erweiterung dreielementiger Basen bei konstanter Frobeniuszahl. |
scientific article; zbMATH DE number 3875406 |
Statements
Erweiterung dreielementiger Basen bei konstanter Frobeniuszahl. (English)
0 references
1984
0 references
three element additive bases
0 references
constant Frobenius number
0 references
Euclidean division algorithm
0 references
0.9240786
0 references
0.8538607
0 references
0.8433075
0 references
0.84240645
0 references
0.83964777
0 references
Let \(A_k = \{a_1,a_2,\ldots,a_k\}\subseteq\mathbb N\), \((a_1,a_2,\ldots,a_k)=1\) and \(D(A_k):=\{\sum^k_{i=1} x_ia_i\mid x_i\in \mathbb N_0\}\). The largest integer which is not contained in \(D(A_k)\) is called the Frobenius number \(g(A_k)\) of the set \(A_k\). \textit{E. S. Selmer} [J. Reine Angew. Math. 293--294, 1--17 (1977; Zbl 0349.10009)] asked for conditions on \(a\in\mathbb N\), \(a\not\in D(A_k)\) such that \(g(A_k\cup\{a\})=g(A_k)\) and showed that this is impossible for \(k=2\). In the paper under review this question for \(k=3\) is considered. Let \(A_3=\{a_1,a_2,a_3\}\), \(a_1<a_2<a_3\), \((a_1,a_2,a_3)=1\). In the case \(1<a<a_2\), \(a_1\nmid a\) the author gives a necessary and sufficient condition for \(g(A_3\cup \{a\})=g(A_3)\). This condition is expressed in terms of an Euclidean division algorithm depending on the elements of \(A_3\). From this it follows that \(g(A_3\cup \{a\})<g(A_3)\) always holds for \(1<a<a_1\). There is also stated a result for the case \(1<a<a_3\). The proof will be published elsewhere.
0 references