On the geometry of the Frobenius problem

From MaRDI portal





If \(a_1,\dots,a_n\) are given positive integers, then the Frobenius number \(F(a_1,\dots,a_n)\) is the smallest positive integer not of the form \(L(x_1,\dots,x_m)=\sum_{i=1}^nx_ia_i\) with integers \(x_i\geq0\). There is a large literature on this (see e.g. the book of \textit{J. L. Ramírez Alfonsín} [The Diophantine Frobenius Problem. Oxford Lecture Series in Mathematics and its Applications 30. Oxford: Oxford University Press (2005; Zbl 1134.11012)]). \textit{V. I. Arnold} [Funct. Anal. Other Math. 2, No. 2--4, 129--138 (2009; Zbl 1201.11009)] has given a geometrical procedure of finding the Frobenius number in the case \(n=3\). The author extends this to arbitrary \(n\) and presents a way of determining all positive integers not represented by the form \(L\).











This page was built for publication: On the geometry of the Frobenius problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035287)