Alan J. Hoffman

Alan J. Hoffman
Name	Alan J. Hoffman
Birth date	1924-02-21
Death date	2021-01-07
Nationality	American
Fields	Mathematics, Operations Research, Linear Algebra, Combinatorics
Alma mater	City College of New York, Harvard University
Doctoral advisor	Hassler Whitney
Known for	Eigenvalue techniques in combinatorics, Hoffman bound, Hoffman–Singleton graph

Alan J. Hoffman (February 21, 1924 – January 7, 2021) was an American mathematician and administrator noted for contributions to linear algebra, combinatorics, graph theory, and operations research. He developed eigenvalue methods applied to Johnson scheme, Kneser graph, and extremal problems and played leadership roles at institutions and agencies including the IBM Watson Research Center, National Science Foundation, and the University of California, Los Angeles. Hoffman's work influenced researchers in Paul Erdős's network, Richard P. Stanley's combinatorics, and the development of algebraic graph theory used by László Lovász and Béla Bollobás.

Early life and education

Hoffman was born in New York City and attended Stuyvesant High School before studying at City College of New York. He pursued graduate studies at Harvard University where he completed a Ph.D. under Hassler Whitney, joining a lineage connected to Oswald Veblen and Norbert Wiener. During his formative years he encountered contemporaries at Institute for Advanced Study, collaborators from Bell Labs, and mentors linked to developments at Princeton University and Columbia University.

Academic and professional career

Hoffman held positions across academia, industry, and government. He served as a researcher at IBM, contributing to projects related to computer science at the IBM Watson Research Center and interacting with scientists from Thomas J. Watson Research Center. He took on leadership roles at the National Science Foundation and advised programs intersecting with Defense Advanced Research Projects Agency concerns and National Research Council activities. In academia he taught and supervised students at institutions including Cornell University, Brown University, and University of California, Los Angeles where he collaborated with faculty associated with Merrill Flood, George Dantzig, and Jack Edmonds.

Hoffman's professional network reached across organizations such as the Society for Industrial and Applied Mathematics, the Mathematical Association of America, and the American Mathematical Society. He participated in conferences hosted by International Congress of Mathematicians and workshops alongside figures like C. R. Rao, Alan Turing's intellectual heirs at Cambridge University, and contributors to the Erdős–Rényi model.

Research contributions and legacy

Hoffman's research advanced algebraic methods in combinatorics and graph theory. He introduced the Hoffman bound relating eigenvalues of adjacency matrices to independence numbers, which found application in studies of the Hoffman–Singleton graph, Paley graph, and families of strongly regular graphs such as the Shrikhande graph and Clebsch graph. His eigenvalue interlacing techniques influenced later work by Fan R. K. Chung, Chris Godsil, and Richard A. Brualdi. Hoffman's investigations connected the spectral theory of matrices developed by John von Neumann and Israel Gelfand to extremal combinatorics problems considered by Pál Erdős and Tibor Gallai.

He co-developed linear algebraic approaches to problems in the assignment problem lineage stemming from Kőnig's theorem and Hungarian algorithm traditions, informing algorithmic research by Jack Edmonds and Michael J. Fischer. His collaborative papers bridged topics studied at Bell Labs and AT&T, and influenced modern treatments in texts by Richard Stanley and László Lovász. Hoffman's mentoring produced students who worked with research programs at Bell Labs, IBM Research, and universities including MIT and Stanford University.

Beyond specific theorems, his legacy includes the promotion of spectral graph theory within combinatorics curricula at places like Princeton University and Harvard University, and contributions to national research policy through advisory roles with National Science Foundation panels and committees linked to Office of Naval Research priorities.

Awards and honors

Hoffman received recognition from mathematical societies and institutions. He was associated with honors conferred by the American Mathematical Society and the Society for Industrial and Applied Mathematics, and invited to speak at meetings of the International Congress of Mathematicians and symposia organized by SIAM. His work was commemorated in conference proceedings alongside honorees including Paul Erdős, Hassler Whitney, László Lovász, and Claude Berge. He served on editorial boards of journals tied to Elsevier and publishers of the Springer-Verlag portfolio, and participated in prize selection committees related to awards named for John von Neumann and Norbert Wiener.

Selected publications

- A. J. Hoffman, "On eigenvalues and colorings of graphs", in proceedings and journals alongside work by Pál Erdős and Richard Rado. - A. J. Hoffman and R. R. Singleton, "Moore graphs with diameter 2 and degree 57", a collaborative paper linking to studies by C. T. Benson and G. A. Miller. - A. J. Hoffman, contributions to texts and articles cited by Fan R. K. Chung, Chris Godsil, and Béla Bollobás on spectral methods. - A. J. Hoffman, papers on matrix theory and combinatorics referenced in works by Hassler Whitney, John von Neumann, and Israel Gelfand. - A. J. Hoffman, selected survey articles appearing in volumes published by Springer, Elsevier, and conference collections associated with International Congress of Mathematicians.

Category:American mathematicians Category:1924 births Category:2021 deaths