Applied combinatorial mathematics
authors, George Pólya ... [et al.] ; editor, Edwin F. Beckenbach.
Malabar, Fla. : R. E. Krieger, 1981, ©1964.
xxi, 608 págs. : ilustraciones ; 24 cm.
ISBN: 0898741726
Basado en la Statewide Lecture Series on Applied Combinatorial Mathematics, ofrecida por University Extension, Engineering and Physical Sciences Divisions, University of California, en 1962.
Reimpresión. Publicado originalmente: New York : Wiley, c1964. (University of California engineering and physical sciences extension series).
Incluye referencias bibliográficas.
Reseña: MathSciNet, 30 #4687 (ed. original)
Contenido
- Pt. 1A, Computation and evaluation: 1. The machine tools of combinatorics / Derrick H. Lehmer
- 2. Techniques for simplifying logical networks / Montgomery Phister, Jr.
- Pt. 1B, Counting and enumeration: 3. Generating functions / John Riordan
- 4. Lattice statistics / Elliott W. Montroll
- 5. Pólya's theory of counting / N. G. de Bruijn
- 6. Combinatorial problems in graphical enumeration / Frank Harary
- Pt. 2, Control and extremization: 7. Dynamic programming and Markovian decision processes, with particular application to baseball and chess / Richard Bellman
- 8. Graph theory and automatic control / Robert Kalaba
- 9. Optimum multivariable control / Edwin L. Peterson
- 10. Stopping-rule problems / Leo Breiman
- 11. Combinatorial algebra of matrix games and linear programs / Albert W. Tucker
- 12. Network flow problems / Edwin F. Beckenbach
- Pt. 3, Construction and existence: 13. Block designs / Marshall Hall, Jr.
- 14. Introduction to information theory / Jacob Wolfowitz
- 15. Sperner's lemma and some extensions / Charles B. Tompkins
- 16. Crystallography / Kenneth N. Trueblood
- 17. Combinatorial principles in genetics / George Gamow
- 18. Appendices / Hermann Weyl.