The Diophantine Frobenius Problem

The Diophantine Frobenius Problem

Volumn , Issue , 2007, Pages 1-264

  Ramuirez Alfonsin, Jorge L ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Denumerants; Frobenius number; Gaps; Integer representation; Modular change problem; Postage stamp problem; Semigroups

Indexed keywords

EID: 84920492213     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780198568209.001.0001     Document Type: Book

References (489)

1. K. Aardal and A.K. Lenstra, Hard equality constrained integer knapsacks, Mathematics of Operat. Res. 29(3) (2004), 724-738.
2. N. Abe, Characterizing PAC-learnability of semilinear set, Inform. and Comp. 116(1) (1995), 81-102.
3. N. Abe, Money changing problem is NP-Complete, Technical Report MSCIS-87-45, University of Pennsylvania, June (1987).
4. O. Achou, The number of feasible solutions to a Knapsack problem, SIAM J. Appl. Math. 27(4) (1974), 606-610.
5. G. Agnarsson, On the Sylvester denumerants for general restricted partitions, in the proceedings of the thirty-third southeastern international conference on combinatorics, graph theory and computing (Boca Raton, Florida, 2002) Congr. Numer. 154 (2002), 49-60.
6. M. Ajtai, J. Komlós and E. Szmerédi, An O(n log n) sorting method, Proceedings 15th Annual ACM Symposium of Theory of Computing, Boston Mass., (1983).
7. R. Alter and J.A. Barnett, A postage stamp problem, Am. Math. Monthly 87 (1980), 206-210.
8. D.F. Anderson and J. Winner, Factorization in, in Factorization in integral domains (Iowa City, 1996), Lecture Notes in Pure and Appl. Math., 189, Dekker, New York, (1997), 243-255.
9. G. Angermüller, Die Wertehalbgruppe einer ebenen irreduziblen Kurven, Math. Z., 153 (1977), 267-282.
10. M. Anshel, Vectors group and the equality problem for vector addition systems, Math. Comp. 32 (1978), 614-616.
11. M. Anshel and D. Goldfeld, Applications of the HardyRamanujan partition theory to linear Diophantine problems, J. Ramanujan Math. Soc. 3(1) (1988), 97-110.
12. M. Anshel and K. McAloon, Reducibilites among decision problems for HNN groups, vector addition systems and subsystems of Peano arithmetic, Proc. Am. Math. Soc. 89(3) (1983), 425-429.
13. R. Apéry, Sur les branches superlinéaires des courbes algébriques, C.R. Acad. Sci. Paris 222 (1946), 1198-1200.
14. T.M. Apostol, Introduction to Analytic Number Theory, Undergraduate Texts in Mathematics, Springer-Verlag, New York, Heidelberg, (1976).
15. E. Arbarello, M. Cornalba, P.A. Griffiths and J. Harris, Geometry of algebraic curves, I (Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]), 267 Springer-Verlag, New York, (1985).
16. C. Arf, Une interprétation algébrique de la suite des ordres de multiplicité d'une branche algébrique, Proc. London Math. Soc. 50(2) (1948), 256-287.
17. V.I. Arnold, Weak asymptotics for the number of solutions of diophantine problems, Functional Analysis and Its Applications 33(4) (1999), 292-293.
18. V.I. Arnold, Frequent representations, Moscow Math. J. 3(4) (2003), 1209-1221.
19. V.I. Arnold, Problem No. 2003-5 in Arnold's Problems, Springer Berlin, New York (2004).
20. M.F. Atiyah and I.G. Macdonald, Introduction to Commutative Algebra, Addison-Wesley, Reading, Mass. (1969).
21. J. Backelin, On the number of semigroups of natural numbers, Math. Scand. 66(2) (1990), 197-215.
22. A. Badra, Frobenius number of a linear diophantine equation, Commutative ring theory and applications (Fez, 2001) Lecture Notes in Pure and Applied Mathematics, 231, Dekker, New York, (2003), 23-36.
23. R.M. Barbosa, Partitions of numbers in allowed parts 1-3-4, 1-3-5 and 1-4-5, Rev. Mat. Estatist. 2 (1984), 43-49.
24. V. Barucci, D.E. Doobs and M. Fontana, Maximality properties in numerical semigroups, with applications to one-dimensional analytically irreducible local domains, Proc. of the Conference 'Commutative Ring Theory', Fés, Lectures Notes in Pure Applied Mathematics 153, M. Dekker, New York (1993), 13-25.
25. V. Barucci, D.E. Doobs and M. Fontana, Maximality properties of onedimensional analytically irreducible local domains, Memoires Am. Math. Soc. 125/598 (1997).
26. A. Barvinok, Lattice points and lattice polytopes, in Handbook of Discrete and Computational Geometry (eds. J.E. Goodman and J. O'Rourke), CRC Press Ser. Discrete Math. Appl., CRC, Boca Raton, Florida, (1997), 133-152.
27. A. Barvinok and J. Pommersheim, An algorithmic theory of lattice points in polyhedra, in New Perspectives in Algebraic Combinatorics (eds. L.J. Billera, A. Björner, C. Green, R.E. Simion and R.P. Stanley) Math. Sci. Res. Inst. Publ. 38 Cambridge University Press, (1999).
28. A. Barvinok and K. Woods, Short rational generating functions for lattices point problems, J. Am. Math. Soc. 16(4) (2003), 957-979.
29. P.T. Bateman, Remark on a recent note on linear forms, Am. Math. Month. 65 (1958), 517-518.
30. D. Bayer and M. Stillman, Computation of Hilbert functions, J. Symb. Comput. 14 (1992), 31-50.
31. M. Beck, R. Diaz and S. Robins, The Frobenius problem, rational polytopes, and Fourier-Dedekind sums, J. Number Theory, 96(1) (2002), 1-21.
32. M. Beck and S. Robins, A formula related to the Frobenius problem in two dimensions, Number Theory (New York) 2003 Springer New York, (2004), 17-23.
33. M. Beck, I.M. Gessel and T. Komatsu, The polynomial part of a restricted partition function related to the Frobenius problem, Electron. J. Combinatorics 8(1) (2001), Note 7, 5 pages.
34. M. Beck, D. Einstein and S. Zacks, Some experimental results on the Frobenius problem, Experiment. Math. 12(3) (2003), 263-269.
35. M. Beck and S. Zacks, Refined upper bounds for the linear diophantine problem of Frobenius, Adv. Appl. Math. 32(3) (2004), 454-467.
36. A.G. Beged-Dov, Lower and upper bounds for the number of lattice points in a simplex, SIAM J. Appl. Math. 22(1) (1972), 106-108.
37. D.E. Beihoffer, J. Hendry, A. Nijenhuis and S. Wagon, Faster algorithms for Frobenius numbers, Elect. J. Comb., to appear.
38. E.T. Bell, Interpolated denumerants and Lambert series, Am. J. Math. 65 (1943), 382-386.
39. E.T. Bell, Notes on denumerants, J. Indian Math. Soc. 3 (1938), 41-45.
40. E.R. Berlekamp, J.C. Conway and R.K. Guy, Winning Ways, Academic Press, London, (1985), 575-606.
41. J. Bertin and P. Carbonne, Sur la structure des semi-groupes d'entiers et application aux branches, C.R. Acad. Sci. Paris, Ser A 280 (1975), 1745-1748.
42. J. Bertin and P. Carbonne, Semi-groupes d'entiers et application aux branches, J. Algebra 49 (1977), 81-95.
43. A. Beutelspacher, Partitions of a finite vector space: An application of the Frobenius number in geometry, Arch. Math. 31(2) (1978), 202-208.
44. O. Beyer, The problem of Frobenius in three variables (in Norwegian), Thesis, University of Bergen, Dept. of Mathematics, (1976).
45. G.R. Blakley, Combinatorial remarks on partitions of a multipartite number, Duke Math. J. 31 (1964), 335-340.
46. G.R. Blakley, Algebra of formal power series, Duke Math. J. 31 (1964), 341-345.
47. G.R. Blakley, Formal solution of nonlinear simultaneous equations: Reversion of series in several variables, Duke Math. J. 31 (1964), 347-357.
48. J. Blaz˙ewicz, P. Formanowicz, M. Kasprzak, P. Schuurman and G. Woeginger, DNA sequencing, Eulerian graphs, and the exact perfect matching problem Lectures Notes in Computer Sciences 2573 (2002), 13-24.
49. J. Blaz˙ewicz, P. Formanowicz, M. Kasprzak, W.T. Markiewicz and J. Weglarz, DNA sequencing with positive and negative errors, J. Comput. Biol. 6 (1999), 113-123.
50. G. Blom and C.-E. Frőberg, On money changing, (Swedish), Nordisk Matematisk Tidskrift. Normat 10 (1962), 55-69.
51. S. Böcker and Z. Lipták, The money changing problem revisited: computing the Frobenius number in time O(ka 1), Technical Report No. 2004-2, University of Bielefeld, Technical Faculty (2004), 7 pages.
52. B. Bojanok, The conductor of positive integers, a problem of Frobenius, J. Math. Informat. Quart. 7(2) (1997), 58-61.
53. P. Boldi, M. Santini and S. Vigna, Measuring with jugs, Theor. Comput. Sci. 282 (2002), 259-270.
54. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, McMillan, London; North-Holland, New York, (1976).
55. E. Boros, Subadditive approach to a linear diophantine problem of Frobenius, Technical Report MO/38 Computer and Automation Inst., Hungarian Academy of Sciences, (1983).
56. E. Boros, On a linear diophantine problem for geometrical type sequences, Technical Report Computer and Automation Inst., Hungarian Academy of Sciences, (1986); Discrete Math. 66 (1987), 7-33.
57. A. Brauer, On a problem of partitions, Am. J. Math. 64 (1942), 299-312.
58. A. Brauer and B.M. Seelbinder, On a problem of partitions II, Am. J. Math. 76 (1954), 343-346.
59. A. Brauer and J.E. Shockley, On a problem of Frobenius, J Reine Angewandte Math. 211 (1962), 215-220.
60. H. Bresinsky, On prime ideals with generic zero xi = tni, Proc. Am. Math. Soc. 47(2) (1975), 329-332.
61. H. Bresinsky, Symmetric semigroups of integers generated by 4 elements, Manuscripta Math. 17 (1975), 205-219.
62. H. Bresinsky, Monomial Gorenstein curves in A 4 as set theoretical complete intersection, Manuscripta Math. 27 (1979), 353-358.
63. H. Bresinsky, Monomial Gorenstein idelas, Manuscripta Math. 29 (1979), 159-181.
64. H. Bresinsky, Minimal free resolutions of monomial curves in , Linear Algebra Applic. 59 (1984), 121-129.
65. V.E. Brimkov, A polynomial algorithm for solving a large subclass of linear diophantine equations in nonnegative integers, C.R. Acad. Bulgare Sci. 41(11) (1988), 33-35.
66. V.E. Brimkov, Effective algorithms for solving a broad class of linear diophantine equations in nonnegative integers, Mathematics and Mathematical Education (Bulgarian) (Albena, 1989) Bulgar. Akad. Nauk., Sofia (1989), 241-246.
67. V.E. Brimkov, On a Frobenius problem, Mathematics and Mathematical Education (Bulgarian) (Proceedings 19th Spring Conf. Sunny Beach/Bulg., 1990), Acad. Sci., Sofia (1990), 84-87.
68. V.E. Brimkov and R.P. Bârneva, Gradient Elements of the Knapsack Polytope, Calcolo 38(1) (2001), 49-66.
69. V.E. Brimkov and R.P. Bârneva, Polynomial subclasses of the linear diophantine problems, Rapport 96/11, Université Louis Pasteur, Strasbourg, France (1996).
70. M. Brion, Points entiers dans les polyèdres convexes, Ann. Sci. Ecole Normale Superieur 21 (1988), 653-663.
71. M. Brion and M. Vergne, Lattice points in simple polytopes, J. Am. Math. Soc. 10(2) (1997), 371-392.
72. M. Brion and M. Vergne, Residue formulae vector partition functions and lattice points in rational polytopes, J. Am. Math. Soc. 10(4) (1997), 797-833.
73. W. Brown and F. Curtis, Numerical semigroups of maximal and almost length, Semigroup Forum 42(2) (1991), 219-235.
74. T.C. Brown, W.-S. Chou and P.J. Shiue, On the partition function of a finite set, Australasian J. Comb., 27(2003), 193-204.
75. T.C. Brown and P.J. Shiue, A remark related to the Frobenius problem, The Fibonacci Quarterly 31(1) (1993), 32-36.
76. W. Bruns, J. Gubeladze and N.V. Trung, Problems and algorithms for affine semigroups, Semigroup Forum 64 (2002), 180-212.
77. R.-O. Buchweitz, On Zariski's criterion for equisingularity and nonsmoothable monomial curves, Thèse, Paris VII, (1981).
78. R.-O. Buchweitz, Ü ber deformationem monomialer kurvensingularitäten und Weierstrasspunkte auf Riemannschen flÄchen, Thesis, Hannover, (1976).
79. J.S. Byrnes, On a partition problem of Frobenius, J. Comb. Theor. Ser.A 17 (1974), 162-166.
80. J.S. Byrnes, A partition problem of Frobenius II, Acta Arithmetica 28 (1975), 81-87.
81. A. Campillo and J.I. FarrÁn, Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models, Finite Fields Appl. 6(1) (2000), 71-92.
82. A. Campillo and C. Marijuan, Higher order relations for a numerical semigroup, Séminaire de Théorie des Nombres, Bordeaux 3 (1991), 249-260.
83. A. Campillo and M.A. Revilla, Coin exchange algorithms and toric projective curves, Commun. Algebras 29(7) (2001), 2985-2989.
84. S.E. Cappell and J.L. Shaneson, Genera of algebraic varieties and counting of lattice points, Bull. Am. Math. Soc. 30 (1994), 62-69.
85. A. Cayley, On a problem of double partitions, Philos. Mag. XX (1860), 337-341.
86. K. Chandrasekhar, Arithmetical Functions, Springer-Verlag, New York, Berlin, (1970).
87. G. Chartrand, R.J. Gould and S.F. Kapoor, On homogeneously traceable nonhamiltonian graphs, Annals N.Y. Acad. Sci. 319 (1979), 130-135.
88. Z.-M. Chen, Acta Sci. Sichuan Univ. 1 (1956), 57-59.
89. Z.-M. Chen, A theorem on linear form with integral coefficient (in Chinese), Sichuan Daxue Xuebao 1 (1956), 1-3.
90. Z.-M. Chen, An algorithm to find M3, (in Chinese), J. Southwest Teachers College 3 (1984), 2-8.
91. Q.H. Chen and Y.J. Liu, A result on the Frobenius problem, (Chinese) Fujian Shifan Daxue Xuebao Ziran Kexue Ban, 11(3) (1995), 33-37.
92. P. Chrzastowski-Wachtel, A bound for the diophantine problem of Frobenius, unpublished manuscript, (1992).
93. P. Chrzastowski-Wachtel and M. Raczunas, Liveness of weighted circuits and the Diophantine problem of Frobenius; in Fundamentals of Computation Theory (Szeged, Hungary 1993), Lecture Notes Comput. Sci. 710 (1993), 171-180.
94. J.H. Clarke, Conditions for the solutions of a linear diophantine equation, The New Zealand Math. Mag. 14 (1977), 45-47.
95. V. Chvátal, Flip-flops in hypohamiltonian graphs, Can. Math. Bull. 6 (1973), 33-41.
96. L. Comtet, Advanced Combinatorics, D. Reidel Publishing Company, Dordrecht, Holland, (1974).
97. W.H. Cornish, A combinatorial problem and the generalized cosh, in Combinatorial Mathematics, X (Adelaide, 1982), Lecture Notes in Math. 1036, Springer, Berlin (1983), 147-153.
98. G. Cornuejols, R. Urbaniak, R. Weismantel and L. Wolsey, Decomposition of integer programs and of generating sets, Algorithms-ESA ?97M (Graz), Lecture Notes in Comput. Sci. 1284 (1997), 92-103.
99. D. Cox, J. Little and D. O?Shea, Using Algebraic Geometry, Graduate Text in Mathematics 185, Springer-Verlag, New York (1998).
100. F. Curtis, On formulas for the Frobenius number of a numerical semigroup, Math. Scand. 67 (1990), 190-192.
101. G. Csorba, Über die partitionen der ganzen Zahlen, (German) Math. Annal. 75 (1914), 545-568.
102. Z. Dang, O.H. Ibarra and Z.-W. Sun, On the emptiness problem for twoway NFA with one reversal-bounded counter, Algorithms and Computation, Lectures Notes in Computer Sciences 2518, (2002), 103-114
103. M. D'Anna, Type Sequences of Numerical Semigroups, Semigroup Forum 56 (1998), 1-31.
104. J.L. Davison, On the linear diophantine of Frobenius, J. Number Theory 48 (1994), 353-363.
105. J.A. Deddens, A combinatorial identity involving relatively prime integers, J. Comb. Theory Ser.A 26(2) (1979), 189-192.
106. C. Delorme, Sousmonoïdes d'intersection complète de N, Ann. Scient. de l'École Normale Supérieure 9(4) (1976), 145-154.
107. P. Dembowski, Finite Geometries, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 44 Springer-Verlag, Berlin, New York, (1968).
108. G. Denham, Short generating functions for some semigroup algebras, Electron. J. Comb. 10 (2003), Research paper 36, 7 pages.
109. C. Del Vigna, Partition colorée d'entiers: Applications à une methode de calcule des denumerants, Analyse appliquée et informatique (journée de combinatoire et informatique) (eds. J.-C. Bermond and R. Cori) Bordeaux (1975), 103-109.
110. R. Diaz and S. Robins, The Ehrhart polynomial of a lattice n-simplex, Electron. Res. Announc. Am. Math. Soc. 2(1) (1996), 1-6.
111. J. Dixmier, Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius, J. Number Theory 34 (1990), 198-209.
112. L.E. Dickson, History of the Theory of Numbers, Vol II, New York, Chelsea, (1992).
113. M. Djawadi, Kennzeichnung von Mengen mit einer additiven mininaleigenschaft, J. Reine Angewandte Math. 311/312 (1979), 307-314.
114. M. Djawadi, Zum linearen Diophantischen Problem von Frobenius, (On the linear diophantine problem of Frobenius), Bull. Iranian Math. Soc., 9(2) (1981/82), 127-142.
115. M. Djawadi and G.R. Hofmeister, Linear diophantine problems, Arch. Math. 66 (1996), 19-29.
116. M. Djawadi and G.R. Hofmeister, Linear diophantine problems, Number Theory, New York, 1991-1995, Springer, New York, (1996), 91-95.
117. W. Dobosiewicz, An efficient variation of bubble sort, Informat. Process. Lett. 11(1) (1980), 5-6.
118. D.E. Doobs and G.L. Matthews, On comparing two chains of numerical semigroups and detecting Arf semigroups, Semigroup Forum 63 (2001), 273-246.
119. D.E. Dobbs and G.L. Matthews, On a question of Wilf concerning numerical semigroups, manuscript, 16 pages.
120. A.L. Dulmage and N.S. Mendelsohn, Gaps in the exponent set of primitive matrices, Illinois J. Math. 8 (1964), 642-656.
121. E. Ehrhart, Sur un problème de géometrie diophantienne linèaire I, J. Reine Angewandte Math. 226 (1967), 1-29.
122. E. Ehrhart, Sur un problème de géometrie diophantienne linéaire II, J. Reine Angewandte Math. 227 (1967), 25-49.
123. E. Ehrhart, Nombre de solutions d'un systeme diophantienne eulerien, C. R. Acad. Sci. Paris Séries A 285 (1977), 317-320.
124. E. Ehrhart, Polynôme Arithmetique et Méthode des Polyedres en Combinatoire, 35 Serie ISNM, Birkhauser, Basle, (1977).
125. E. Ehrhart, Sur les polyèdres rationnels homothétiques à n dimensions, C.R. Acad. Sci. Paris, 254 (1962), 616-618.
126. H. Engels, Numerical Cuadrature and Cubature, Computational Mathematics and Applications, Academic Press, London, New York, (1980).
127. P. Erdős, Problem P-84, Can. Math. Bull. 14 (1971), 275-277.
128. P. Erdős, On an elementary proof of some asymtoptic formulas in the theory of partition, Ann. Math. 43(2) (1942), 437-352.
129. P. Erdős and R.L. Graham, On a linear diophantine problem of Frobenius, Acta Arithmetica 21 (1972), 399-408.
130. P. Erdős and R.L. Graham, Old and new problems and results in combinatorial number theory, Monographies de l'Enseignement Mathecute;matiques 28, Université de Genève, (1980).
131. P. Erdős, P.M. Grùber and J. Hammer, Lattice Points, Pitman Monograph Series in Pure and Applied Mathematics 39 Longman, Harlow (1989).
132. P. Erdős and J. Lehner, The distribution of the number of summands in the partitions of a positive integer, Duke J. of Math. 8 (1941), 335-345.
133. M. Estrada and A. López, A note on symmetric semigroups and almost arithmetic sequences, Commun. Algebra 22(10) (1994), 3903-3905.
134. L. Euler, Observ. anal. de combinationibus, Comm. Acad. Pretrop. 13, ad annum 1741-1743. (1751).
135. L. Euler, Introductio in Analysin Infinitorium, I, M.-M. Bousqut, Lausanne, (1748) [reprinted as Leonhardi Euleri Opera Omnia, Ser. I Vol. VIII (A. Krazer and F. Rudio, eds.), Teubner, Leipzig, 1922] [German translation by H. Maser: Einleitung in die Analysis des Unendlichen, Erster Teil, Springer, Berlin, (1885).
136. L. Euler, De partitione numerorum in partes tam numero quam specie dates, Novi Commentarii Academiae Scientiarum Imperialis Petropolitanae 14 (1769) (1770), 168-187. [reprinted in Leonhardi Euleri Opera Omnia, Ser. I Vol. III (Commentationes Arithmeticae Vol. II) (F. Rudio, ed.), Teubner, Leipzig, (1917), 132-147.
137. J.I. Farrán, On Weierstrass semigroups and one-point algebraic geometry codes, Coding theory, cryptography and related areas (Guanajuato, 1998), (2000), 90-101.
138. L.G. Fel, Frobenius problem for semigroups S(d1, d2, d3), manuscript (2004), 43 pages.
139. W. Feller, An Introduction to Probability Theory and its Applications, J. Wiley, New York (1950).
140. G.L. Feng and T.R.N. Rao, Decoding algebraic-geometric codes up to the designed minimum distance, IEEE Trans. Inform. Theory 39 (1993), 37-45.
141. K.G. Fischer and J. Shapiro, Mixed matrices and binomial ideals, J. Pure Appl. Algebra 113 (1996), 39-54.
142. K.G. Fischer, W. Morris and J. Shapiro, Affine semigroups rings that are complete intersections, Proc. Am. Math. Soc. 125(11) (1997), 3137-3145.
143. K.G. Fischer, W. Morris and J. Shapiro, Mixed dominating matrices, Linear Algebra Appl. 270 (1998), 191-214.
144. F.G. Frobenius, Theorie der linearen Formen mit ganzen Coefficienten, J. Reine Angewandte Math. 86 (1878), 146-208.
145. F.G. Frobenius, Über Matrizen aus nicht negative Elementen, Sitzungsberichte der Königlich Preussischen Akademie der Wissenschaften zu Berlin, (1912), 456-477.
146. R. Fröberg, The Frobenius number of some semigroups, Commun. Algebra 22(14) (1994), 6021-6024.
147. R. Fröberg, C. Gottlieb and R. Häggkvist, On numerical semigroups, Semigroup Forum 35 (1987), 63-83.
148. M.A. Frumkin, On the number of nonnegative integer solutions of a system of linear diophantine equations, Studies on Graphs and Discrete Programming (ed. P. Hansen), North-Holland (1981), 95-108.
149. P.A. García-Sánchez and J.C. Rosales, Numerical semigroups generated by intervals, Pacific J. Math. 191(1) (1999), 75-83.
150. P.A. García-Sánchez and J.C. Rosales, on complete intersection affine semigroups, Commun. Algebra 23(14) (1995), 5395-5412.
151. P.A. García-Sánchez and J.C. Rosales, On free affine semigroups, Semigroup Forum 58 (1999), 367-385.
152. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company, New York, (1979).
153. S. Gaubert and C. Klimann, Rational computation in dioid algebra and its application to performance evaluation of discrete event systems, in Algebraic computing in control (Paris, 1991), Lecture Notes in Control and Inform. Sci. 165 Springer, Berlin, (1991), 241-252.
154. G. Gilmore and R.E. Gomory, A linear programming approach to the cutting stock problem, Operat. Res. 9 (1961), 849-859.
155. J.W.L. Glaisher, Formulae for partitions into given elements, derived from Sylvester?s theorem, Quart. J. Math. 40 (1909), 275-348.
156. J.W.L. Glaisher, On a number of partitions of a number into a given number of parts, Quart. J. Math. 40 (1909), 57-143.
157. E.L. Goldberg, On a linear diophantine equation, Acta Arithmetica 31 (1976), 239-246.
158. R.E. Gomory, An algorithm for integer solutions to linear programs, Princeton IBM Math. Res. Report Nov. (1958); and in Recent Advanced in Mathematical Programming (eds. R.L. Graves and P. Wolf), McGraw-Hill, New York (1963), 269-302.
159. R.E. Gomory, Outline of an algorithm for integer solutions to linear programs, Bull. Am. Math. Soc. 64 (1958), 275-278.
160. R.E. Gomory, Solving linear programmming problems, in: Combinatorial Analysis (eds. R. Bellman and M. Hall Jr.) Proceedings of Symposia in Applied Mathematics X, American Math. Soc. Providence, R.I. (1960), 211-215.
161. G. Gonnet, Handbook of Algorithms and Data Structures, Addison-Wesley, (1984).
162. V.D. Goppa, Codes that are associated with divisors, (Russian) Problemy Pereda.ci Informacii 13(1) (1977), 33-39; Translation in Probl. Inform. Transm. 13(1) (1977), 22-26.
163. V.D. Goppa, Algebraic-geometric codes (Russian) Izv. Akad. Nauk SSSR Ser. Mat. 46(4) (1982), 762-781; Translation in Math. USSR Izv. 21(3) (1983), 75-91.
164. V.D. Goppa, Codes on algebraic curves, (Russian) Dokl. Akad. Nauk SSSR 259 (1981), 1289?1290; Translation in Sov. Math. Dokl. 24 (1981), 170-172.
165. D. Gorenstein, An arithmetic theory of adjoint plane curves, Trans. Am. Math. Soc. 72 (1952), 414-436.
166. R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics, Reading, Mass. Addison-Wesley, (1990).
167. D.D. Grant, A finite integer sequence associated with a linear Diophantine equation, Nanta Math. 8(1) (1975), 99-103.
168. D.D. Grant, On linear forms whose coefficients are in arithmetic progression, Israel J. Math. 15 (1973), 204-209.
169. H. Greenberg, An algorithm for a linear diophantine equation and a problem of Frobenius, Numerische Math. 34(4) (1980), 349-352.
170. H. Greenberg, Solution to a diophantine equation for nonnegative integers, J. Algorithm., 9(3) (1988), 343-353.
171. P. Griffiths and J. Harris, Principles of Algebraic Geometry in Pure and Applied Mathematics. Wiley-Interscience [John Wiley and Sons], New York, (1978).
172. P.M. Grundy and C.A.B. Smith, Disjunctive games with the last player losing, Proc. Camb. Philos. Soc. 52 (1956), 527-533.
173. S. Gupta and A. Tripathi, Density of M-sets in arithmetic progression, Acta Arithmetica 89 (1999), 255-257.
174. R.K. Guy, Twenty questions concerning Conway' Sylver coinage, Am. Math. Monthly 83(10) (1976), 634-637.
175. H. Hadwiger, Vorlesungen über Inhalt, Oberfläche und Isoperimetrie, Springer, Berlin, (1957).
176. F. Halter-Koch, The integral closure of a finitely generated monoid and the Frobenius problem in higher dimensions, in Semigroups (Luino, 1992) World Sci. Publishing, River Edge, NJ, (1993), 86-93.
177. Y.O. Hamidoune, On the diophantine Frobenius problem, Portugal Math. 55(4) (1998), 425-449.
178. Y.O. Hamidoune, Some results in additive number theory I: The critical pair theory, Acta Arithmetica 96(2) (2000), 97-119.
179. J. Hammer, Unsolved Problems Concerning Lattice Points, Research Notes in Mathematics 15 Pitman, London (1977).
180. S. Han, C. Kirfel and M.B. Nathanson, Linear forms in finite sets of integers, Ramanujan J. 2 (1998), 271-281.
181. H. Hann-Shuei, An Ialgorithm for the solution of a linear Diophantine Problem of Frobenius, Chin. J. Math. 9(1) (1981), 67-74.
182. G.H. Hardy, Some Famous Problems of the Theory of Numbers and in Particular Waring' Problem, Oxford, U.K. (1920).
183. G.H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proc. London Math. Soc. 17 (1918), 75-115.
184. R.E. Hartwig and M. Neumann, Bounds on the exponenet of primitivity which depend on the spectrum and the minimal polynomial, Linear Algebra Appl. 184), (1993, 103-122.
185. B.R. Heap and M.S. Lynn, The index of primitivity of a non-negative matrix, Numerische Math. 6 (1964), 120-141.
186. B.R. Heap and M.S. Lynn, A graph-theoretic algorithm for the solution of a linear diophantine problem of Frobenius, Numerische Math. 6 (1964), 346-354.
187. B.R. Heap and M.S. Lynn, On a linear diophantine problem of Frobenius: an improved algorithm Numerische Math. 7 (1965), 226-231.
188. O. Heden, The Frobenius number and partitions of a finite vector space, Arch. Math. 42(2) (1984), 185-192.
189. J. Herzog, Generators and relations of abelian semigroups and semigroup rings, Manuscripta Math. 3 (1970), 175-193.
190. J. Herzog, Generators and relations of abelian semigroups and semigroup rings, Thesis, Lousiana State University, New Orleans, La., USA, (1969).
191. J. Herzog and E. Kunz, Die Werthalbgruppe eines lokalen Rings der dimension 1, Sitzungsberichte der Heidelberger Akademie der Wissenschaften 2 (1971), 27-67.
192. M. Herzog and J. Sch?nheim, Group partition, factorization and the vector covering problem, Can. Math. Bull. 15(2) (1972), 207-214.
193. G. Higman, B.H. Neumann and H. Neumann, Embedding theorems for groups, J. London Math. Soc. 24 (1949), 247-254.
194. D. Hilbert, Ueber die Theorie der algebraischen Formen, Math. Annalen 36 (1890), 473-534.
195. C.W. Ho, J.L. Parish and P.J. Shiue, On the sizes of elements in the complement of a monoid of integers, Proceedings of the Fourth International Conference on Fibonacci Numbers and Their Applications (1991), 139-144.
196. G.R. Hofmeister, Zu einem Problem von Frobenius, Norske Videnskabers Selskabs Skrifter, 5 (1966), 1-37; Math. Rev. 34 (1967) #5792.
197. G.R. Hofmeister, Lineare diophantische Probleme, Joh. Gutenberg-Universität, Mainz (1978).
198. G.R. Hofmeister, Eine Verallgemeinerung des Reichweitenproblems (German), Abh. Braunschweig. Wiss. Ges. 33 (1982), 161-163.
199. G.R. Hofmeister, Remark on linear forms, Arch. Math. 65 (1995), 511-515.
200. G.R. Hofmeister, Extremal Frobenius number in a class of sets, Arch. Math. 70 (1998), 357-365.
201. G.R. Hofmeister, Linear diophantine problems, Bull. Iranian Math. Soc. 8(2) (1980/81), 121-155.
202. A. Horváth and M. Hujter, Some algorithms for a problem of Frobenius, preprint, Hungary, (1982).
203. T. Høholdt, J.V. van Lint and R. Pellikaan, Algebraic geometry codes, in Handbook of Coding Theory 1 (eds. V.S. Pless, W.C. Huffman and R.A. Brualdi) Amsterdam, The Netherlands, Elsevier (1998), 871-961.
204. H.S. Huang, An algorithm for the solution of a linear diophantine problem of Frobenius, Chinese J. Math. 9(1) (1981), 67-74.
205. M. Hujter, Lower bounds for the Frobenius problem, Technical Report MO/43 Computer and Automation Inst., Hungarian Academy of Sciences, (1982).
206. M. Hujter, On a problem of Frobenius: a Survey, Technical Report MO/44 Computer and Automation Inst., Hungarian Academy of Sciences, (1982).
207. M. Hujter, On a sharp upper and lower bounds for the Frobenius problem, Technical Report MO/32 Computer and Automation Inst., Hungarian Academy of Sciences, (1982).
208. M. Hujter, On the lowest value of the Frobenius number, Technical Report MN/31 Computer and Automation Inst., Hungarian Academy of Sciences, (1987).
209. M. Hujter, On the coin exchange problem of Frobenius, Technical Report MN/32 Computer and Automation Inst., Hungarian Academy of Sciences, (1987).
210. M. Hujter, Improved lower and upper bounds for the number of feasible solutions to a Knapsack problem, Optimization 19(6) (1988), 889-894.
211. M. Hujter and B. Vizvári, The exact solution to the Frobenius problem with three variables, J. Ramanujan Math. Soc. 2(2) (1987), 117-143.
212. J. Incerpi and R. Sedgewick, Improved upper bounds on ShellSort, J. Comput. Systems Sci. 31 (1985), 210-224.
213. K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, Springer-Verlag, New York, Heidelberg, Berlin, (1980).
214. M.Z. Israilov, Numbers of solutions of linear diophantine equations and theirapplications in the theory of invariant cubature formulas (in Russian), Sibirskii Matematicheskii Zhurnal 22(2) (1981), 121-136 [English translation: Siberian Math. J. 22(2) (1981), 260-273].
215. N.N. Ivanov and V.N. Shevchenko, The structure of a finitely generated semilattice (Russian), Dokl. Akad. Nauk. BSSR, 19 (1975), 773-774.
216. A. Janz, Bestimmung der maximalen Frobeniuszahl, Master thesis, Johannes Guttenberg Universität, Mainz, April (1997).
217. S.M. Johnson, A linear diophantine problem, Can. J. Math. 12 (1960), 390-398.
218. S.C. Johnson and B.W. Kernighan, Making change with a minimum number of coins, Bell Laboratories, Murray Hill, New Jersey, manuscript undated.
219. C.A. Jones, Using linear forms to determine the set of integers realizable by (g 0, g 1,...,g n )-trees, Discrete Math. 47 (1983), 247-254.
220. L. Juan, Some results about symmetric semigroups, Commun. Algebra 21(10) (1993), 3637-3645.
221. I.D. Kan, On the Frobenius problem, (Russian) Fundam. Prikl. Mat. 3(3) (1997), 821-835.
222. I.D. Kan, B.S. Stechkin and I.V. Sharkov, On the Frobenius problem for three arguments, (Russian) Mat. Zametki, 62 (4) (1997), 626-629; translation in Math. Notes, 62(3-4) (1997), 521-523.
223. I.D. Kan, Representation of numbers by linear forms, (Russian) Mat. Zametki 68(2) (2000), 210-216; translation in Math. Notes 68(1-2) (2000), 185-190.
224. I.D. Kan, The Frobenius problem for classes of polynomial solvability, (Russian) Mat. Zametki 70(6) (2001), 845-853; translation in Math. Notes 70(5-6) (2001), 771-778.
225. J. Kang and Z. Liu, A relation between M 3 and linear congruence equations (Chinese) J. Southwest Teach. Univ., Ser. B 2 (1987), 1-7.
226. R. Kannan, Lattice translates of a polytope and the Frobenius problem, Combinatorica 12(2) (1992), 161-177.
227. R. Kannan, The Frobenius problem, Foundations of software technology and theoretical computer science, Bengalore, 1981, Lectures Notes in Comput. Sci. 405, Springer, Berlin, (1989), 247-251.
228. J.M. Kantor and A. Khovanskii, Une application du théorème de Riemann-Roch combinatoire au polynôme d'Ehrhart des polytopes entier de R n , C.R. Acad. Sci. Paris Serie I 317 (1993), 501-507.
229. H. Kaufman, A bibliographical note on higher order sine functions, Scripta Math. 28 (1967), 29-36.
230. Z. Ke, On the equation of ax+by+cz =n, J. Sichuan Univ. Math. Biquarterly (natural science edition) 1 (1955), 1-4.
231. J.G. Kemeny and J.L. Snell, Finite Markov Chains, D. Van Nostrand Company, Inc., Princeton (1960).
232. A.G. Khovanskii, Newton polyhedron, Hilbert polynomial and sums of finite sets, Functional Analalysis and Its Applications 26(4) (1992), 276-281; translation from Funkts. Anal. Prilozh. 26(4) (1992), 57-63.
233. A.G. Khovanskii, Sums of finite sets, orbits of commutative semigroups, and Hilbert functions, Func. Anal. Appl. 29(2) (1995), 120-112.
234. H.G. Killingbergtrø, Betjening av figur i Frobenius' problem (Using figures in Frobenius' problem), (Norwegian) Normat 2 (2000), 75-82.
235. C. Kirfel, Erweiterung dreielementiger Basen bei konstanter Frobeniuszahl, Math. Scand. 54 (1984), 310-316.
236. C. Kirfel, Erweiterung dreielementiger Basen bei konstanter Frobeniuszahl II, Math. Scand. 58 (1986), 149-160.
237. C. Kirfel, Stabilitä bei symmetrischen h -basen, (German), Acta Arith. 51(1) (1988), 85-96.
238. C. Kirfel and R. Pellikaan, The minimum distance of codes in an array coming from telescopic semigroups, IEEE Trans. Informat. Theor. 41(6) (1995), 1720-1732.
239. C. Kirfel and E.S. Selmer, Regular h -ranges and weakly pleasant h - bases, Math. Scand. 59 (1986), 30-40.
240. G. Kiss, Extremal Frobenius number in some special cases, Annales Univ. Sci. Budapest 44 (2001), 27-31.
241. G. Kiss, Extremal Frobenius number in a new aspect, Annales Univ. Sci. Budapest 44 (2002), 139-142.
242. L.F. Klosinski, G.L. Alexanderson and L.C. Larson, The Fifty- Second William Lowell Putnman Mathematical Competition, Am. Math. Monthly 9 (1992), 715-724.
243. M. Kneser, Abschätzung der asymptotischen Dichte von Summenmengen, Math. Z. 58 (1953), 459-484.
244. D. E. Knuth, The Art of Computer Programming, 3: Sorting and Searching, Addison-Wesley, Reading Mass. (1973).
245. C. Ko, Acta Sci. Sichuan Univ. 1 (1955), 1-4.
246. C. Ko, D. Li and W. Yin, Acta Sci. Sichuan Univ. 3 (1964), 39-50.
247. T. Komatsu, The number of solutions of the diophantine equation of Frobenius-general case, Math. Commun. 8(2)(2003), 195-206.
248. J. Komeda, Non-Weierstrass numerical semigroups, Semigroup Forum 57 (1998), 157-185.
249. J. Komeda, Remarks on non-Weierstrass numerical semigroups, Algebras and Combinatorics. An International Congress, ICAC'97, Hong Kong (eds. K.-P. Shum, E.J. Taft and Z.-X. Wan), Springer-Verlag (1999), 313-319.
250. J. Komeda, On Weierstrass points whose first non-gaps are four, J. Reine Angew. Math. 341 (1983), 68-86.
251. J. Kraft, Singularity of monomial curves in A 3 and Gorenstein monomial curves in A 4, Can. J. Math. 37(5) (1985), 872-892.
252. E. Krätzel, Die maximale Ordnung der Anzahl der wesentlich verschiedenen abelschen Gruppen n-ter Ordnung (German), Quart. J. Math. Oxford Ser. 2 21 (1970), 273-275.
253. H. Krawczyk and A. Paz, The diophantine problem of Frobenius: A close bound, Discrete Appl. Math. 23 (1989), 289-291.
254. E. Kunz, The value-semigroup of a one-dimensional Gorenstein ring, Proc. Am. Math. Soc. 25 (1970), 748-751.
255. E. Kunz, Über die Klassifikation numerischer Halbgruppen, (German) (On the classification of numerical semigroups), Regensburger Mathematische Schriften (Regensburg Mathematical Publications) 11 Universität Regensburg, Fachbereich Mathematik, Regensburg, (1987).
256. E. Kunz, Introduction to Commutative Algebra and Algebraic Geometry, Birkhäuser, Basel (1985).
257. S. Kuriki, Une identité introduite par le dénuméerant, TRU Math. 13 (1977), 53-54.
258. S. Kuriki, Sur une méthode de calcul du dénumérant, TRU Math. 14 (1978), 47-48.
259. E.N. Laguerre, Partition des nombres, (French) Bull. Soc. Math. France V (1877).
260. D.T. Lee C.L. Liu and C.K. Wong, (g 0, ..., g k )-trees and unary OL systems, Theor. Comput. Sci. 22 (1983), 209-217.
261. T. Leighton Tight bounds on the complexity of parallel sorting, in Proc. 16th Annual ACM Symposium of Theory of Computing, Washington D.C., April (1984).
262. H.W. Lenstra, Integer programming with a fixed number of variables, Math. Operat. Res. 8 (1983), 538-548.
263. H.W. Lenstra and C. Pomerance, Primality testing with Gaussian periods, preprint (2004), 41 pages.
264. V.F. Lev, Structure theorem for multiple addition and the Frobenius problem, J. Number Theory 58 (1996), 79-88.
265. V.F. Lev, On the extremal aspect of the Frobenius problem, J. Comb. Theory Ser. A 73 (1996), 111-119.
266. V.F. Lev, Addendum to 'Structure theorem for multiple addition', J. Number Theory 65 (1997), 96-100.
267. V.F. Lev, Optimal representations by sumsets and subset sums, J. Number Theory 62 (1997), 127-143.
268. V.F. Lev, On consecutive subset sums, Discrete Math. 187 (1998), 151-160.
269. M. Lewin, An algorithm for a solution of a problem of Frobenius, J. Reine Angewandte Math. 276 (1975), 68-82.
270. M. Lewin, A bound for a solution of a linear diophantine problem, J. London Math. Soc. 6 (1972), 61-69.
271. M. Lewin, On a diophantine problem of Frobenius, Bull. London Math. Soc. 5 (1973), 75-78.
272. M. Lewin, On a problem of Frobenius for almost consecutive set of integers, J. Reine Angewandte Math. 273 (1975), 134-137.
273. W. Lex, Über Lösungsanzhlen linearer diophantischer Gleichungen, Math.-phys. Semesterberichte 24 (1977), 254-279.
274. J. Lipman, Stable ideals and Arf rings, Am. J. Math. 93 (1971), 649-685.
275. P. Lisoněk, Denumerants and their approximations, J. Combin. Math. Combin. Comput. 18 (1995), 225-232.
276. P. Lisoněk, 'Quasi-Polynomials: A case study in Experimental Combinatorics', Technical report Series, RISC-Linz, Austria 93-18 (1993).
277. C.L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, New York (1955).
278. L. Lovász, Geometry on numbers and integer programming, in: proceedings of the 13th International Symposium on Mathematical Programming, (eds. M. Iri and K. Tanabe), Tokyo Math. Prog. (1989), 177-178.
279. W. Lu, Acta Sci. Sichuan Univ. 1 (1956), 49-55.
280. W. Lu and C. Wu, Acta Sci. Sichuan Univ. 2 (1957), 151-171.
281. G.S. Lueker, Two NP-complete problems in nonnegative integer programming, Technical Report TR-178, Department of Electrical Engineering, Princeton University (1975).
282. S. L'vovsky, On inflection points, monomial curves, and hypersurfaces containing projective curves, Math. Ann. 306 (1996), 719-735.
283. P.L. Manley, A note on linear forms, Ranchi Univ. Math. J. 9 (1978), 77-80.
284. H.B. Mann, An addition theorem for sets of elements of an abelian group, Proc. Am. Math. Soc. 4 (1953), 423.
285. O. Marstrander, On a problem of Frobenius, Math. Scand. 58(2) (1986), 161-175.
286. H. Matternich, Über ein Problem bei Frobenius, Basiserweiterung bei Konstanter Mathematik, Johannes Gutenberg- Univ., Mainz, (1981).
287. C. McDiarmid and J.L. Ramñrez Alfonsñ, Sharing jugs of wine, Discrete Math. 125 (1994), 279-287.
288. P. McMullen, Valuations and Euler-type relations on certain classes of convex polytopes, Proc. London Math. Soc. 35(3) (1977), 113-135.
289. P. McMullen, Lattice invariant valuations on rational polytope, Arch. Math. 31 (1978), 509-516.
290. N.S. Mendelsohn, A linear diophantine equation with applications to non-negative matrices, in Proceedings of the International Conference on Combinatorial Mathematics, New York 1970 (eds. A. Gewirtz and L.V. Quintas), Ann. New York Acad. Sci., 175 (1970), 287-294.
291. C. Mereghetti and G. Pighizzini, Optimal simulations between unary automata, SIAM J. Comput. 30(6) (2001), 1976-1992.
292. G. Meures, Zusammenhang zwischen Reichweite und Frobeniuszahl, Staatexamenarbeit, Johannes Gutenberg-Univ., Mainz, (1977).
293. H. Metternich, Über ein Problem von Frobenius. Basiserweiterung bei konstanter Frobeniuszhl, Diplomarbeit Math. Inst., Joh. Gutenberg-Univ., Mainz (1981)
294. V. Male, On monomial semigroups, Comm. Alg. 30(10) (2002), 4687-4698.
295. P.B. Milanov, The linear diophantine problem of Frobenius and discrete optimization, (German) Diskrete Optimierung, Wissensch. Beitr., Friedrich-Schiller-Univ., Jena, (1985), 73-82.
296. H. Minc, Nonnegative matrices, Series in Discrete Mathematics and Optimazation, Wiley-Interscience, New York, (1988).
297. M. Morales, Syzygies of monomial curves and a linear diophantine problem of Frobenius, Internal Report, Max Planck Institut für Mathematik, Bonn, (1987).
298. M. Morales, Noetherian symbolic blow-ups, J. Algebra 140(1) (1991), 12-25.
299. L.J. Mordell, Lattice points in a tetrahedron and generalized Dedekind sums, J. Indian Math. Soc. (N.S.) 15 (1951), 41-46.
300. R. Morikawa, On the linear diophantine problem of Frobenius in three variables, Bull. Fac. Liberal Arts Nagasaki Univ. 38(1) (1997), 1-17.
301. M. Nagata and H. Matsumura, A theorem in elementary arithmetic, (Japanese) Sûgaku 13 (1961-62), 161; Math. Rev. 25(3) (1963).
302. D.A. Narayan and A.J. Schwenk, Tiling large rectangles, Math. Mag. 75(5) (2002), 372-380.
303. M.B. Nathanson, Sums of finite sets of integers, Am. Math. Monthly 79 (1972), 1010-1012.
304. M.B. Nathanson, Partitions with parts in a finite set, Proc. Am. Math. Soc. 128 (2000), 1269-1273.
305. E. Netto, Lehrbuch der Combinatorik, (Second Edition) Leipzig and Berlin, B.G. Teubner (1927).
306. H. Niederreiter, Random numbers generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Mathematics, 63, SIAM, Philadelphia, (1992).
307. M. Nijenhuis and H.S. Wilf, Representation of integers by linear forms in nonnegative integers, J. Number Theory 4 (1972), 98-106.
308. C. Niu and Z. Oiu, On a problem of Frobenius, (Chinese) J. Shandong Univ. Nat. Sci. Ed. 21(1) (1986), 1-6.
309. X.F. Niu, A formula for the largest integer which cannot be represented as (Chinese) Heilongjiang Daxue Ziran Kexue Xuebao 9(4) (1992), 28-32.
310. I. Niven, H.S. Zuckerman and H.L. Montgomery, An Introduction to the Theory of Numbers, 5th edn New York, John Wiley and Sons, (1991).
311. R.Z. Norman, Some observations on linear diophantine representations, Proc. 8th Con. Combinatorics, Graph Theory and Computing; Baton Rouge, Congressus Nemeratium 19 (1977), 511-522.
312. B.V. Novikov, On the structure of subsets of a vector lattice that are closed with respect to addition, J. Math. Sci. 72(4) (1994), 3223-3225.
313. T.H. O'Beirne, Puzzles and Paradoxes, Oxford University Press, New York and London, (1965).
314. G. Oliveira, Weierstrass semigroups and the canonical ideal of non- trigonial curves, Manuscripta Math. 71 (1991), 431-450.
315. M. Ontkush, A closed formula for linear indeterminate equations in two variables, Pi Mu Epsilon 9(1) (1989), 16-18.
316. Th. Ottman, H.W. Six and D. Wood, On the correspondance between AVL trees and brother trees, Computing 23 (1979), 43-54.
317. R.W. Owens, An algorithm to solve the Frobenius problem, Math. Mag. 74(4) (2003), 264-275.
318. M.W. Padberg, A remark on 'an inequality for the number of lattice points in a simplex', SIAM J. Appl. Math. 20(4) (1971), 638-641.
319. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Inc., (1982).
320. A.A. Papernov and G.V. Stasevich, A method of information sorting in computer memories, Probl. Inform. Transmiss. 1(3) (1965), 63-75.
321. D.P. Patil and B. Singh, Generators for the derivation modules and the relation ideals of certain curves, Manuscripta Math. 68 (1990), 327-335.
322. R. Pellikaan and F. Torres, On Weierstrass semigroups and the redundancy of improved geometric Goppa codes, IEEE Trans. Informat. Theor 45(7) (1999), 2512-2519.
323. C.A. Petri, 'Kommunikation mit Automaten', Schriften des Rheinisch-Westfalischen Institutes für Instrumentelle Mathematik an der Universität Bonn, Hft. 2 Bonn, (1962). Translated into English by Project ISTP: 'Communication with Automata,' translated by C.F. Greene, Jr., a Supplement to Technical Documentary Report No. 1 prepared for Rome Air Development Center #AF 30 (602)-3344, (1965).
324. G. Pick, Geometrisches zur Zahlenlehre, Sitzungsber. Lotos (Prague) 19 (1899M), 311-319.
325. J. Piehler, Bemerkungen zum Frobenius-problem, (German) Wiss. Z. Tech. Hochsch. Leuna-Merseburg 29(4) (1987), 496-502.
326. J. Piehler, Bemerkungen zu einer Arbeit von ùber die Anzahl zulàssiger Lòsungen eines Knapsack-Problems, (German) Math. Operationsforsch. Statist. Ser. Optim 9(2) (1978), 167-170.
327. J. Piehler, Ùber die nichtnegativen L'osungen linearer diophantischer Gleichungen, (German) Wiss. Z. Tech. Hochsch. Leuna-Merseburg 27(3) (1985), 320-327.
328. J. Pitman and P. Leske, A number-theoretical note on Cornish's paper, in Combinatorial Mathematics, X (Adelaide, 1982), Lecture Notes in Math. 1036, Springer, Berlin (1983), 316-318.
329. P. Pleasants, H. Ray and R.J. Simpson, The Frobenius problem on lattices, Australasian J. Comb., 32 (2005), 27-45.
330. G. Pólya and G. Szegó, Aufgaben und Lehrsàtze aus der Analysis, Srpinger-Verlag, Berlin (1925). English translation: Problems and Theorems in Analysis, Springer-Verlag, New York, (1972).
331. J.E. Pommersheim, Toric varieties, lattice points and Dedekind sums, Math. Ann. 295 (1993), 1-24.
332. T. Popoviciu, Asupra unei probleme de patitie a numerelor,Acad. Republicii Populare Romane, Filiala Cluj, Studii si cercetari stiintifice (Romanian) 4 (1953), 7-58.
333. V. Pratt, Shellsort and Sorting Networks, Garland Publishing, New York (1979); Ph.D. thesis, Stanford University, (1971).
334. M. Raczunasand P. Chrz?astowski-Wachtel, A diophantine problem of Frobenius in terms of the least common multiple, Discrete Math. 150 (1996), 347-357.
335. H. Rademacher and E. Grosswald, Dedekind Sums, Carus Mathematical Monographs Math. Assoc. Am., 16 (1972).
336. H. Rademacher, On the partition function, Proc. London Math. Soc. 43 (1937), 241-254.
337. H. Rademacher, A convergent series for the partition function, Proc. Nat. Acad. Sci. U.S.A. 23 (1973), 78-84.
338. J.L. Ramírez Alfonsín, Topics in Combinatorics and Computational Complexity, D.Phil. Thesis, University of Oxford, U.K., (1993).
339. J.L. Ramírez Alfonsín, Complexity of the Frobenius problem, Combinatorica 16(1) (1996), 143-147.
340. J.L. Ramírez Alfonsín, On variations of the subset sum problem, Discrete Appl. Math. 81 (1998), 1-7.
341. J.L. Ramírez Alfonsín, The diophantine Frobenius problem, Forschungsinstitut für Diskrete Mathematik, Bonn, Report No.00893 (2000), 43 pages.
342. J.L. Ramírez Alfonsín, Gaps in semigroups, manuscript, 15 pages.
343. J.L. Ramírez Alfonsín, On the Frobenius number and the covering radius, manuscript, 18 pages.
344. J.L. Ramírez Alfonsín, The Frobenius number via Hilbert Series, manuscript, 12 pages.
345. J.E. Reeve, On the volume of lattice polyhedra, Proc. Lond. Math. Soc. III(7) (1957), 378-395.
346. L. Reid and L.G. Roberts, Monomial subrings in arbitrary dimension, J. Algebra 236 (2001), 703-730.
347. E. Remy and E. Thiel, Medial axis for chamfer distances: computing look-up tables and neighbourhoods in 2D or 3D, Pattern Recong. Lett. 23 (2002), 649-661.
348. D.S. RimM and M.A. Vitulli, Weierstrass points and monomial curves, J. Algebra 48 (1977), 454-476.
349. J. Riordan, An Introduction to Combinatorial Analysis, Princeton University Press, Guildford, Surrey, (1978).
350. S.M. Ritter, The linear diophantine problem of Frobenius for subsets of arithmetic sequences, Arch. Math. 69 (1997), 31-39.
351. S.M. Ritter, On a linear diophantine problem of Frobenius: Extending the basis, J. Number Theory 69 (1998), 201-212.
352. J.B. Roberts, Note on linear forms, Proc. Am. Math. Soc. 7 (1956), 465-469.
353. J.B. Roberts, On a diophantine problem, Can. J. Math. 9 (1957), 219-222.
354. J.B. Roberts, Interaction of cycles, Bull. Math. Biophys. 10 (1948), 123-129.
355. H. Rohrbach, Einige neuere Untersuchungen über die Dichte in der additiven Zahlentheorie, Jahresbericht der Deutschen Mathematiker Vereinigung 48 (1939), 199-236.
356. H. Rohrbach, Ein Beitrag zur additiven Zahlentheorie, Math. Zeitschrift 42 (1937), 1-30.
357. H. Rohrbach, Anwendung eines Satzes der additiven Zahlentheorie auf eine gruppentheoretische Frag., Math. Zeitschrift 42 (1937), 538-542.
358. V. Romanovski, Recherches sur les chaîin de Markoff, Acta Math., 66 (1936), 147-251.
359. J.C. Rosales, On numerical Semigroups, Semigroup Forum 52 (1996), 307-318.
360. J.C. Rosales, On symmetric numerical semigroups, J. Algebra 182 (1996), 422-434.
361. J.C. Rosales, Numerical semigroups with Apéry sets of unique expression, J. Algebra 226 (2000), 479-487.
362. J.C. Rosales and M.B. Branco, Numerical semigroups that can be expressed as an intersection of symmetric numerical semigroups, J. Pure Appl. Algebra 171(2-3) (2002), 303-314.
363. J.C. Rosales and M.B. Branco, Irreducible numerical semigroups, Pacific J. Math. 209 (1) (2003), 131-143.
364. J.C. Rosales and P.A. García-Sánchez, Every positiveinteger is the Frobenius number of an irreducible numerical semigroup with at most four generators, Ark. Mat. 42(2) (2004), 301-306.
365. J.C. Rosales, P.A. García-Sánchez and J.I. García García, Every positive integer is the Frobenius number of a numerical semigroup with three generators, Math. Scand. 94(1) (2004), 5-12.
366. J.C. Rosales, P.A. García-Sánchez, J.I. García-García and J.A. Jiménez Madrid, Fundamental gaps in numerical semigroup, J. Pure Appl. Algebra 189(1) (2004), 301-313.
367. J.C. Rosales and P.A. García-Sánchez, Numerical semigroups with embedding dimension three, Arch. Math. 83 (2004), 488-496.
368. J. Rosenmüller and H.G. Weidner, extreme convex set functions with finite carrier: General Theory, Discrete Math. 10 (1974), 343-382.
369. J. Rosiak, The minimum exponent of the primitive diagraphs on the given number of arcs, Opuscula Math. 24(2) (2004), 197-202.
370. ø.J. Rødseth, On a linear diophantine problem of Frobenius, J. Reine Angewandte Math. 301 (1978), 171-178.
371. Ø.J. Rødseth, On a linear diophantine problem of Frobenius II, J. Reine Angewandte Math. 307/308 (1979), 431-440.
372. Ø.J. Rødseth, A note on Brown and Shue?s paper on a remark related to the Frobenius problem, Fibonacci Quart. 32(5) (1994), 407-408.
373. Ø.J. Rødseth, An upper bound for the h-range of the postage stamp problem, Acta Arith. 54(4) (1990), 301-306.
374. Ø.J. Rødseth, On h-bases for n, Math. Scand. 48(2) (1981), 165-183.
375. Ø.J. Rødseth, On h-bases for n. II, Math. Scand. 51(1) (1982), 5-21.
376. Ø.J. Rødseth, Two remarks on linear forms in nonnegative integers, Math. Scand. 51(2) (1982), 193-198.
377. Ø.J. Rødseth, An upper bound for the h-range of the postage stamp problem, Acta Arith. 54(4) (1990), 301-306.
378. R.Y. Rubistein, Simulation and Monte Carlo Method, John Wiley and Sons, New York, (1981).
379. A. Rycerz, Conductors and the generalized problem of Frobenius, Discuss. Math. 14 (1994), 15-20.
380. A. Rycerz and Z. Skupień, Conductors in the integral monoids, 3rd Twente Workshop on Graphs and Combinatorial Optimization (eds. U. Faigle and C. Hoede), University of Twente, Holland 1993, Memorandum No. 1132, (1993), 154-158.
381. A. Rycerz, The generalized residue classes and integral monoids with minimal sets, Opuscula Math. 20(7-10) (2000), 65-69.
382. A.V. Sardo-Infirri, Lefschetz fixed-point theorem and lattice points in convex polytopes, Adv. Math. 116 (1995), 55-81.
383. H.E. Scarf and D.F. Shallcross, The Frobenius problem and maximal lattice free bodies, Math. Oper. Res. 18 (1993),511-515.
384. J.-C. Schlage-Puchta, An estimate for Frobenius's diophantine problem in three dimensions, J. Integer Sequences 8(1) (2005), Article 05.1.7.
385. M. Schoch, An investigation to the Frobenius problem, Advances in Mathematical Optimization, Math. Res. 45 Akademie-Verlag, Berlin (1988), 191-195.
386. M. Schoch, Zur Lösung einer speziellen linearen diskreten Optimierungsaufgabe mit Zusatzforderungen, Math. Operatinsforsch. Statist. Series Optimization 13(3) (1982), 373-392.
387. I.J. Schur, Zur additiven zahlentheorie, Sitzungsberichte Preussische Akad. Wiss. Phys. Math. Kl. (1926), 488-495.
388. R. Sedgewick, A new upper bound for ShellSort, J. Algorithms 7 (1986), 159-173.
389. E.S. Selmer, On the linear diophantine Problem of Frobenius, J. Reine Angewandte Math. 293/294(1) (1977), 1-17.
390. E.S. Selmer, On ShellSort and the Frobenius problem, BIT 29(1) (1989), 37-40.
391. E.S. Selmer and B.K. Selvik, On Rødseth's h-bases A k = {1, a 2, 2a2..., (n - k)a 2, a k }, Math. Scand. 68(2) (1991), 180-186.
392. E.S. Selmer, On regular Frobenius bases, Math. Scand. 63(1) (1988), 109-116.
393. E.S. Selmer, Two popular problems in number theory. I. Changing coins, Normat 29(2) (1981), 81-87.
394. E.S. Selmer, Two popular problems in number theory. II. Thepostage stamp problem, Normat 29(3) (1981), 105-114.
395. E.S. Selmer, Note on the postage stamp problem, Normat 31(1) (1983), 30-48.
396. E.S. Selmer, On the postage stamp problem with three stamp denominations, Math. Scand. 47(1) (1980), 29-71.
397. E.S. Selmer, On the postage stamp problem with three stamp denominations. II, Math. Scand. 53(2) (1983), 145-156.
398. E.S. Selmer, On the postage stamp problem with three stamp denominations. III, Math. Scand. 56(2) (1985), 105-116.
399. E.S. Selmer, Associate bases in the postage stamp problem, J. Number Theory 42 (1992) 320-336.
400. E.S. Selmer, The local postage stamp problem, I-III Institute Rep. Nos. 42, 44, 57, University of Bergen, Dept. of Pure Math., (1986, 1990).
401. E.S. Selmer and O. Beyer, On the linear diophantine problem of Frobenius in three variables, J. Reine Angewandte Math. 301 (1978), 161-170.
402. S. Sertöz, On the number of solutions of the diophantine equation of Frobenius, Diskret. Mat. 10(2) (1998), 62-71; translation in Discrete Appl. Math. 8(2) (1998), 153-162.
403. S. Sertöz, On Arf rings, Appendix in 'The Collected Papers of Cahit Arf, Turkish Math. Soc. (1990), 416-419.
404. S. Sertöz and A. Özlük, On a diophantine problem of Frobenius, Bull. Tech. Univ. Istanbul 39(1) (1986), 41-51.
405. S. Sertöz and A. Özlük, On the number of representations of an integer by a linear form, Instanbul Üniv. Fen Fak. Mat. Der. 50 (1991), 67-77.
406. J. Shallit, What this country needs is a 18 cents piece, The Mathematical Intelligencer (2003), 20-23.
407. J. Shallit, The computational complexity of the local postage stamp problem, SIGACT News 33(1) (2002), 90-94.
408. J. Shallit and M.-W. Wang, Automatic complexity of string, J. Automata, Languages, Comb. 6(4) (2001), 537-554.
409. J.Y. Shao, Some computational formulas of the Frobenius numbers (Chinese), J. Math. (Wuhan University) 8(4) (1988), 375-388.
410. W.J.C. Sharp, Solution to Problem 7382, Educational Times 37 (1884), 26 reprinted in Mathematical questions with their solutions, Educational Times (with additional papers and solutions) 41 (1884), 21.
411. D.L. Shell, A high-speed sorting procedure, Commun. ACM 27 (1959), 30-32.
412. J. Shen, An improvement of the Dulmage-Mandelsohn theorem, Discrete Math. 158 (1996), 295-297.
413. J. Shen, A short proof of a theorem on primitive matrices, Proceedings of the Twenty-seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 1996), Congr. Numer. 121 (1996), 204-210.
414. J. Shen, A Bound on the exponent of primitivity in terms of diameter, Linear Algebra Appl. 244 (1996), 21-33.
415. J. Shen, A problem on the exponent of primitive digraphs, Linear Algebra Appl. 244 (1996), 244-264.
416. J. Shen, Some estimated formulas for the Frobenius number, Linear Algebra Appl. 244 (1996), 13-20.
417. V.N. Shevchenko, The exchange problem, the Frobenius problem and the group minimization problem, (Russian), Combinatorial- Algebraic methods in applied mathematics Gors'kov. Gos. Univ. Gorki, (1982).
418. G. Sicherman, Theory and practice of Sylver coinage, Integers: Electron. J. Comb. Number Theory 2(# G2) (2002), 11 pages.
419. E. Siering, Über lineare Formen und ein Problem von Frobenius, Dissertation, Joh. Gutenberg-Univertät Mainz (1974).
420. E. Siering, Über lineare Formen und ein Problem von Frobenius, J. Reine Angewandte Math. 301 (1978), 161-170.
421. R.J. Simpson and R. Tijdeman, Multi-dimensional version of a theorem of fine and Wilf and a formula of Sylvester, Proc. Am. Math. Soc. 131(6) (2003), 1661-1671.
422. T. Skolem, Über einige Satzfunktionen in der Arithmetik, (Gernman) Skrifter Norske Vitenskapsakademiet Akad., Oslo, Math.-Naturv. KI. 7 (1931), 1-28.
423. Z. Skupień, Homogeneously traceable and Hamiltonian connected graphs, Demonstratio Math. 17 (1984), 1051-1067.
424. Z. Skupień, A generalization of Sylvester's and Frobenius' problems on numerical semigroups, Acta Arithmetica 65(4) (1993), 353-366.
425. Z. Skupień, Exponential constructions of some nonhamiltonian minima, in: Proc. 4th Czechoslovakian Symposium on Combinatorics, Graphs and Complexity, (eds. J. Nešetřil and M. Fiedler) Ann. Discrete Math. 51 Elsevier (1992), 321-328.
426. P.E. Smith, Source Book in Mathematics 1 and 2 Dover, New York, (1959).
427. C. Smoryński, Skolem's solution to a problem of Frobenius, Math. Intelligencer 3(3) (1980/1981), 123-132.
428. S.L. Sobolev, The formulas of mechanical cubature on the surface of a sphere, Sib. Mat. Zh. 3 (1962), 769-796.
429. G. Springer, Introduction to Riemann Surfaces, Addison-Wesley Publishing Company, Inc., Reading, Mass. (1957).
430. R.P. Stanley, Hilbert functions of graded algebras, Adv. Math. 28 (1978), 57-83.
431. R.P. Stanley, Combinatorics and Commutative Algebra, Prog. in Math., Birkhäuser 41 (1983).
432. B.S. Stechkin and V.I. Baranov, Extremal Combinatorial problems and their application, Mathematics and its Applications 335, Kluwer Acad. Publishers Group, Dordrecht, (1995).
433. Q. Sun, Some results on diophantine equations, in Number theory and its applications in China, Contemp. Math. 77 (1988), 113-126.
434. J.J. Sylvester, Problem 7382, Educational Times 37 (1884), 26; reprinted in: Mathematical questions with their solution, Educational Times (with additional papers and solutions) 41 (1884), 21.
435. J.J. Sylvester, On the partition of numbers, Quart. J. Pure Appl. Math. 1 (1857), 141-152.
436. J.J. Sylvester, On subinvariants, i.e. semi-invariants to binary quanties of an unlimited order, Am. J. Math. 5 (1882), 119-136.
437. J.J. Sylvester, A constructive theory of partitions arranged in three acts, an interact and an exodion, Am. J. Math. 5 (1882), 251-330.
438. L.A. Székely and N.C. Wormald, Generating functions for the Frobenius problem with 2 and 3 generators, Math. Chronicle 15 (1986), 49-57.
439. M.C.K. Tweedie, A Graphical Method of Solving Tartaglian Measuring Puzzles, Math. Gazette 23 (1939), 278-282.
440. B. Temkin, The problem of Frobenius for three variables, Ph.D. Thesis, The City University of New York, (1983).
441. E. Teruel, P. Chrzastowski-Wachtel, J.M. Colom and M. Silva, On weighted T-systems, Advances in Petri Nets, Lecture Notes in Computer Science 616 (1992), 348-367.
442. A. Thoma, Construction of set theoretic complete intersections via semigroup gluing, Beiträge zur Algebra und Geometrie (Contributions to Algebra and Geometry) 41 (1) (2000), 195-198.
443. C. Tinaglia, Su alcune soluzioni di un problema di Frobenius in tre variabili, Boll. U.M.I. 7(2) (1988), 361-383.
444. C. Tinaglia, Some results on a linear problem of Frobenius (Italian), Geometry Seminars, 1996-1997, Univ. Stud. Bologna, Bologna (1998), 231-244.
445. C. Tinaglia, Sulle soluzioni non negative di un sistema lineare diofanteo, Riv. Mat. Univ. Parma 13(4) (1987), 85-90.
446. C. Tinaglia, On the integers independent from three given positive integers, Boll. U.M.I. 7(6) (1992), 1-22.
447. C. Tinaglia, Su certi interi minimi rappresentati da forme lineari a coefficienti interi positivi, Atti dell'Accademia di Scienze Lettere e Arti di Palermo, Serie V-Vol. IX, (1988-89), 189-191.
448. C. Tinaglia, Su un problema lineare di Frobenius in tre variabili, Convegno Per I Sessantacinque anni di Francesco Speranza, Pitagora Editrice, Bologna (1997), 140-145.
449. F. Torres, On γ-hyperelliptic numerical semigroups, Semigroup Forum 55 (1997), 364-379.
450. F. Torres, Weierstrass points and double coverings of curves. With application: symmetric numerical semigroups which cannot be realized as Weierstrass semigroups, Manuscripta Math. 83(1) (1994), 39-58.
451. A. Tripathi, The number of solutions to ax+by = n, J. Fibonacci Quart. 38 (2000), 290-293.
452. A. Tripathi, The coin exchange problem for arithmetic progressions, Am. Math. Monthly 101 (1994), 779-781.
453. A. Tripathi, On a variation of the coin exchange problem for arithmetic progressions, Integers: Electron. J. Combinat. Number Theory 3(# A01) (2003), 1-5.
454. A. Tripathi and S. Vijay, On a generalization of the coin exchange problem for three variables, manuscript (2004), 11 pages.
455. K.M. Tsang, On the linear diophantine problem of Frobenius, Studia Scientiarum Math. Hungarica 23 (1998), 443-453.
456. M.A. Tsfasman, S.G. Vlăduţ and T. Zink, Modular curves, Shimura curves and Goppa codes, better than Varshamov-Gilbert bound, Math. Nachr. 104 (1982), 13-28.
457. H.J.H. Tuenter, The Frobenius problem, sums of powaer of integers and recurrences for Bernoulli numbers, J. Numb. Theory, to appear.
458. J.H. van Lint, Algebraic geometric codes, Coding Theory and Design Theory, IMA Volume in Mathematics and its Applications 20 (1988), 137-162.
459. H.S. Vandiver, On developments in an arithmetic theory of the Bernoulli and allied numbers, Scripta Math. 25 (1961), 273-303.
460. D.E. Varberg, Pick's theorem revisited, Am. Math. Monthly 92 (1985), 584-587.
461. I. Vardi, Computational Recreations in Mathematica, Reading, M.A., Addison-Wesley (1991), 19-20.
462. R.S. Varga, Matrix Interactive Analysis, Princeton-Hall New Jersey, (1962).
463. Y. Vitek, Bounds for a linear diophantine problem of Frobenius, J. London Math. Soc. 10(2) (1974), 79-85.
464. Y. Vitek, Bounds for a linear diophantine problem of Frobenius II, Can. J. Math. 28(6) (1976), 1280-1288.
465. B. Vizvári, Beiträge zum Frobenius-Problem, D.Sc. Nat. Dissertation, Technische Hohschule Carl Schorlemmer, Leuna- Merseburg, Germany (1987).
466. B. Vizvári, On the connection of the Frobenius problem and the knapsack problem, Coll. Math. Soc. János Bolyai, Finite and Infinite Sets 37 (1983), 799-819.
467. B. Vizvári, On a generalization of the Frobenius problem, Technical Report MN/30 Computer and Automation Inst., Hungarian Academy of Sciences (1987).
468. B. Vizvári, An application of Gomory cuts in number theory, Periodica Math. Hung. 18 (1987), 213-228.
469. B. Vizvári, An application of an optimal behaviour of the greedy solution in number theory, Report, 89-9. MTA Számíástechnikaiés Automatizálási KutatóIntézete, Budapest (1989).
470. B. Vizvári, An application of an optimal behaviour of the greedy solution in number theory, Periodica Math. Hung. 27(2) (1993), 69-83.
471. B. Vizvári, Generation of uniformly distributed random vectors of good quality, Rutcor Research Report (1994), No. RRR 17-93.
472. S. Warshall, A theorem of Boolean matrices, J. A.C.M. 9 (1962), 11-12.
473. K. Watanabe, Some examples of one dimensional Gorenstein Domains, Nagoya Math. J. 49 (1973), 101-109.
474. M.A. Weiss, R. Sedgewick, E. Hentschel and A. Pelin, ShellSort and the Frobenius problem, Nineteenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 1988) Congressus Numerantium 65 (1988), 253-259.
475. E.W. Weisstein, "McNugget Number" from MathWorld- A Wolfram Web resource. http://mathworld.wolfram.com/McNuggetNumber.html.
476. D.J.A. Welsh, Percolation and the random cluster model: Combinatorial and Algorithmic Problems, Probabilistic Methods for Algorithmic Discrete Mathematics. (eds. M. Habib, C. McDiarmid, J.L. Ramírez-Alfonsín and B. Reed) Algorithms and Combinatorics 16 Springer-Verlag, Berlin, (1998), 166-194.
477. H.S. Wilf, A circle-of-lights algorithm for the "money-changing problem", Am. Math. Monthly 85 (1978), 562-565.
478. H.S. Wilf, Generatingfunctionology, (Second edition) Academic Press, Inc. Boston, (1994).
479. E.M. Wright, A simple proof of a known result in partitions, Am. Math. Monthly 68 (1961), 144-145.
480. A. G. Xu and Z. H. Wu, The petri net method for solving firstdegree indeterminate equations. III. research on the Frobenius problem (Chinese), Shandong Kuangye Xueyuan Xuebao 12(1) (1993), 63-69.
481. A.C. Yao, An analysis of (h, k, 1)-shellsort, J. Algorithms 1 (1980), 14-50.
482. J.W. Young, On the partitions of a group and mixed perfect codes, Bull. Am. Math. Soc. 33 (1972), 453-461.
483. J. Yuan, Frobenius problem for a linear form in three variables, (Chinese) J. Southwest Teach. Univ. Ser B 3 (1987), 10-19.
484. O. Zariski, Algebraic Surfaces, Springer-Verlag, Berlin (1971).
485. O. Zariski, Le problème des modules pour les branches planes, Hermann, Paris, (1986).
486. De X. Zheng, A note on the Frobenius problem for linear forms, (Chinese) Sichuan Daxue Xuebao 29(2) (1992), 188-192.
487. N. Zhu, A relation between the knapsack and group knapsack problems, Discrete Appl. Math. 87(1-3) (1998), 255-268.
488. J. Zöllner, A note on a paper of Hofmeister, Bull. Iranian Math. Soc. 8(2) (1980/81), 157-160.
489. J. Zöllner, Über angenehme Mengen, Mainzer Seminarberichte in additiver Zahlentheorie 1 (1983), 53-71.