Advanced search
Publication Cover
Experimental Mathematics Volume 12, 2003 - Issue 3
Submit an article Journal homepage
32
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Some Experimental Results on the Frobenius Problem

Matthias Beck Mathematical Sciences Research Institute, 17 Gauss Way, Berkeley, CA, 94720 E-mail: matthias@msrLorg
,
David Einstein Structured Decisions Corp, 1105 Washington St., West Newton, MA, 02465 E-mail: [email protected]
&
Shelemyahu Zacks Department of Mathematical Sciences, State University of New York, Binghamton, NY, 13902-6000 E-mail: [email protected]
Pages 263-269 | Published online: 03 Apr 2012

REFERENCES

  • Ramirez Alfonsin , J. L. 2000 . The Diophantine Frobenius Problem. Forschungsinstitut für diskrete Mathematik, Universität Bonn. . [Alfonsin 00], Report No. 00893
  • Barvinok , Alexander I. 1994 . “Computing the Ehrhart Polynomial of a Convex Lattice Polytope.” . Discrete Comput. Geom. , 12 ( 1 ) : 35 – 48 . [Barvinok 94]
  • Beck , Matthias , Diaz , Ricardo and Robins , Sinai . 2002 . “The Frobenius Problem, Rational Polytopes, and Fourier-Dedekind Sums.” . J. Number Theory , 96 ( 1 ) : 1 – 21 . [Beck et al. 02]
  • Brauer , Alfred . 1942 . “On a Problem of Partitions.” . Amer. J. Math. , 64 : 299 – 312 . [Brauer 42]
  • Brauer , Alfred and Shock , James-ley E. 1962 . “On a Problem of Frobenius.” . J. Reine Angew. Math. , 211 : 215 – 220 . [Brauer and Shockley 62]
  • Davison , J. L. 1994 . “On the Linear Diophantine Problem of Frobenius.” . J. Number Theory , 48 ( 3 ) : 353 – 363 . [Davison 94]
  • Erdös , P. and Graham , R. L. 1972 . “On a Linear Diophantine Problem of Frobenius.” . Acta Arith. , 21 : 399 – 408 . [Erdös and Graham 72]
  • Johnson , S. M. 1960 . “A Linear Diophantine Problem.” . Canad. J. Math. , 12 : 390 – 398 . [Johnson 60]
  • Kannan , Ravi . 1992 . “Lattice Translates of a Polytope and the Frobenius Problem.” . Combinatorica , 12 ( 2 ) : 161 – 177 . [Kannan 92]
  • Knuth , D. E. 1977 . “Notes on Generalized Dedekind Sums.” . Acta Aritm. , 33 : 297 – 325 . [Knuth 77]
  • Lewin , Mordechai . 1975 . “An Algorithm for a Solution of a Problem of Frobenius.” . J. Reine Angew. Math. , 276 : 68 – 82 . [Lewin 75]
  • Nijenhuis , Albert . 1979 . “A Minimal-Path Algorithm for the ‘Money Changing Problem’.” . Amer. Math. Monthly , 86 ( 10 ) : 832 – 835 . [Nijenhuis 79]
  • Rademacher , H. 1964 . “Some Remarks on Certain Generalized Dedekind Sums.” . Acta Arith. , 9 : 97 – 105 . [Rademacher 64]
  • Roberts , J. B. 1956 . “Note on Linear Forms.” . Proc. Amer. Math. Soc. , 7 : 465 – 469 . [Roberts 56]
  • Selmer , Ernst S. 1977 . “On the Linear Diophantine Problem of Frobenius.” . J. Reine Angew. Math. , 293/294 : 1 – 17 . [Selmer 77]
  • Sylvester , J. J. 1884 . “Mathematical Questions with Their Solutions.” . Educational Times , 41 : 171 – 178 . [Sylvester 84]
  • Vitek , Yehoshua . 1975 . “Bounds for a Linear Diophantine Problem of Frobenius.” . J. London Math. Soc. (2) , 10 : 79 – 85 . [Vitek 75]

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.