✦ LIBER ✦

Lattice translates of a polytope and the Frobenius problem

✍ Scribed by Ravi Kannan

Publisher: Springer-Verlag
Year: 1992
Tongue: English
Weight: 961 KB
Volume: 12
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01204720

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Frobenius Problem and the Covering Radiu

Frobenius Problem and the Covering Radius of a Lattice

✍ Lenny Fukshansky; Sinai Robins 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 225 KB

The Frobenius Problem, Rational Polytope

The Frobenius Problem, Rational Polytopes, and Fourier–Dedekind Sums

✍ Matthias Beck; Ricardo Diaz; Sinai Robins 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 195 KB

We study the number of lattice points in integer dilates of the rational polytope x k a k 41 ( ) where a 1 ; . . . ; a n are positive integers. This polytope is closely related to the linear Diophantine problem of Frobenius: given relatively prime positive integers a 1 ; . . . ; a n ; find the lar

The Reflexive Dimension of a Lattice Pol

The Reflexive Dimension of a Lattice Polytope

✍ Christian Haase; Ilarion V. Melnikov 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 148 KB

Frobenius, Cartan, and the Problem of Pf

Frobenius, Cartan, and the Problem of Pfaff

✍ Thomas Hawkins 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 393 KB

The diophantine problem of Frobenius: A

The diophantine problem of Frobenius: A close bound

✍ Hugo Krawczyk; Azaria Paz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 183 KB

On a Linear Diophantine Problem of Frobe

On a Linear Diophantine Problem of Frobenius: Extending the Basis

✍ 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