The linear diophantine problem of Frobenius for subsets of arithmetic sequences
Let \(A_k= \{a_1, \dots, a_k\} \subset N\) with gcd \((a_1, \dots, a_k)=1\) and \(g(A_k)\) the corresponding Frobenius number. Now the special case \(A_k= \{a,ha+ d,ha + 2d, \dots, ha+ (k-1)d\}\) with \(h,d>0\) and gcd \((a,d) =1\) is considered, and \(\ell_k\) is defined as the greatest number of elements which can be omitted without altering \(g(A_k)\). Then it is shown that \[ 1-{4\over \sqrt k} \leq{\ell_k\over k} \leq 1-{3 \over k} \] provided \(a>k\), or \(a=k\) with \(d>2h \sqrt k\). In the case \(a> (k-4)k+3\) the lower bound can be improved to \(1-{4 \over k}\). Moreover, sets \(E_k\subset A_k\) are determined such that \(g(A_k \backslash E_k) =g(A_k)\).
- Linear diophantine problems
- The Frobenius problem for modified arithmetic progressions
- On the Frobenius problem for \(\{a, ha + d, ha + bd, ha + b^{2} d,\ldots, ha+b^{k}d\}\)
- On a linear diophantine problem for geometrical type sequences
- On a linear diophantine problem of Frobenius: Extending the basis
- On a linear diophantine problem of Frobenius: Extending the basis
- On a linear diophantine problem for geometrical type sequences
- Remark on linear forms
- On Numerical Semigroups Generated by Generalized Arithmetic Sequences
- scientific article; zbMATH DE number 3857232 (Why is no real title available?)
- On a problem of Frobenius for an almost consecutive set of integers.
- On regular Frobenius bases.
- scientific article; zbMATH DE number 1896941 (Why is no real title available?)
- On a linear Diophantine problem involving the Fibonacci and Lucas sequences
- Numerical semigroups with monotone Apéry set and fixed multiplicity and ratio
This page was built for publication: The linear diophantine problem of Frobenius for subsets of arithmetic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364581)
