𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Linear Diophantine Problem of Frobenius

✍ Scribed by J.L. Davison


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
351 KB
Volume
48
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis


Suppose (a, b, c) are three positive integers with (\mathrm{gcd}=1). We consider the function (f(a, b, c)) defined to be the largest integer not representable as a positive integral linear combination of (a, b, c). We give a new lower bound for (f(a, b, c)) which is shown to be tight, and we give a new proof of a theorem due to Vitek on an upper bound. A polynomial time algorithm, based on modifications to Rodseth and Selmer/Beyer algorithms, is given for the computation of (f(a, b, c)). Finally, some open problems are discussed. C 1994 Academic Press, Inc.


πŸ“œ SIMILAR VOLUMES


On a Linear Diophantine Problem of Frobe
✍ Stefan Matthias Ritter πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 233 KB

Let X k =[a 1 , a 2 , ..., a k ], k>1, be a subset of N such that gcd(X k )=1. We shall say that a natural number n is dependent (on X k ) if there are nonnegative integers x i such that n has a representation n= k i=1 x i a i , else independent. The Frobenius number g(X k ) of X k is the greatest i

On the Extremal Aspect of the Frobenius
✍ Vsevolod F. Lev πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 347 KB

concerning the well-known diophantine problem of Frobenius was given an exact solution for linear forms with the set of coefficients of density 1 2 (or more). In the present paper, we advance this up to the density 1 3 .

On the Quantum Frobenius Map for General
✍ Edward S. Letzter πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 201 KB

For the quantum function algebras O O M and O O GL , at lth roots of unity q n q n when l is odd, the image under the q-analog of the Frobenius morphism charac-Ε½ . terizes each prime and primitive ideal uniquely up to automorphisms obtained from row and column multiplication of the standard generat

On Frobenius normwise condition numbers
✍ Huaian Diao; Yimin Wei πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 109 KB

## Abstract Condition numbers play an important role in numerical analysis. Classical condition numbers are normwise: they measure the size of both input perturbations and output errors using norms. In this paper, we give explicit, computable expressions depending on the data, for the normwise cond

On the inverse homogenization problem of
✍ Werner S. Weiglhofer πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 90 KB πŸ‘ 2 views

We have demonstrated the light influence of the equipment due to the averaging of the of the stirring. 9.

On the Frobenius Numbers of Symmetric Gr
✍ Yugen Takegahara πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 97 KB

Definition 1.1. A finitely generated group A is said to admit C(p s ) if the following conditions hold for any positive integer q such that 551