Alan J. Hoffman
Alan Hoffman | |
---|---|
Born |
New York City | May 30, 1924
Nationality | American |
Fields | Mathematics |
Institutions |
Thomas J. Watson Research Center City University of New York |
Alma mater | Columbia University |
Thesis | On the Foundations of Inversion Geometry (1950) |
Doctoral advisor | Edgar Lorch |
Doctoral students |
Michael Doob Refael Hassin Thomas McCormick |
Notable awards | John von Neumann Theory Prize (1992) |
Alan Jerome Hoffman (born May 30, 1924[1]) is an American mathematician and IBM Fellow emeritus, T. J. Watson Research Center, IBM, in Yorktown Heights, New York. He is the founding editor of the journal Linear Algebra and its Applications, and holds several patents. He has contributed a great deal to combinatorial optimization and the eigenvalue theory of graphs. Hoffman and Robert Singleton constructed the Hoffman–Singleton graph, which is the unique Moore graph of degree 7 and diameter 2.[2]
Awards
Alan Hoffman is a recipient of many awards.[3]
- IBM Fellow, 1978–
- Member, National Academy of Sciences, 1982–
- Fellow, American Academy of Arts and Sciences, 1987–
- D. Sc. (Hon.) Technion – Israel Institute of Technology, 1986
- 1992 John von Neumann Theory Prize with Philip Wolfe
Select Publications
- Hoffman A. J. & Jacobs W. (1954) Smooth patterns of production. in Management Science, 1(1): 86-91.
- Hoffman A. J. & Wolfe P. (1985) History. Lawler E. L., Lenstra J. K., Rimmooy Kan A. H. G., & Shmoys D. B., eds. in The Traveling Salesman Problem. John Wiley & Sons: New York.
Notes
- ↑ Personal Page, IBM. "Alan Hoffman". IBM Research. Retrieved 2011-11-14.
- ↑ A.E. Brouwer & J.H. van Lint, Strongly regular graphs and partial geometries, in: Enumeration and Design - Proc. Silver Jubilee Conf. on Combinatorics, Waterloo, 1982, D.M. Jackson & S.A. Vanstone (eds.) Academic Press, Toronto (1984) 108.
- ↑ "People: Alan Hoffman". IBM Research. Retrieved 5 January 2015.
References
|
This article is issued from Wikipedia - version of the Saturday, April 30, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.