Herbert Wilf


Herbert Saul Wilf (June 13, 1931 – January 7, 2012) was an American mathematician, specializing in combinatorics and graph theory. He was the Thomas A. Scott Professor of Mathematics in Combinatorial Analysis and Computing at the University of Pennsylvania. He wrote numerous books and research papers. Together with Neil Calkin he founded The Electronic Journal of Combinatorics in 1994 and was its editor-in-chief until 2001.

Herbert Saul Wilf
BornJune 13, 1931
DiedJanuary 7, 2012(2012-01-07) (aged 80)
Alma materColumbia University
Massachusetts Institute of Technology
Known forCombinatorics
Wilf equivalence
Wilf number
Wilf's sequence
Wilf–Zeilberger pair
Calkin–Wilf tree
Stanley–Wilf conjecture
Szekeres–Wilf number
AwardsLeroy P. Steele Prize (1998)
Euler Medal (2002)
Scientific career
InstitutionsUniversity of Pennsylvania
Doctoral advisorHerbert Ellis Robbins
Doctoral studentsFan Chung
Richard Garfield
Rodica Simion
E. Roy Weintraub
Michael Wertheimer

Biography edit

Wilf was the author of numerous papers and books, and was adviser and mentor to many students and colleagues. His collaborators include Doron Zeilberger and Donald Knuth. One of Wilf's former students is Richard Garfield, the creator of the collectible card game Magic: The Gathering. He also served as a thesis advisor for E. Roy Weintraub in the late 1960s.

Wilf died of a progressive neuromuscular disease in 2012.[1]

Awards edit

In 1998, Wilf and Zeilberger received the Leroy P. Steele Prize for Seminal Contribution to Research for their joint paper, "Rational functions certify combinatorial identities" (Journal of the American Mathematical Society, 3 (1990) 147–158).[2] The prize citation reads: "New mathematical ideas can have an impact on experts in a field, on people outside the field, and on how the field develops after the idea has been introduced. The remarkably simple idea of the work of Wilf and Zeilberger has already changed a part of mathematics for the experts, for the high-level users outside the area, and the area itself." Their work has been translated into computer packages that have simplified hypergeometric summation.

In 2002, Wilf was awarded the Euler Medal by the Institute of Combinatorics and its Applications.

Selected publications edit

  • Wilf, Herbert S. (1961). "Perron-Frobenius theory and the zeroes of polynomials". Proc. Amer. Math. Soc. 12 (2): 247–250. doi:10.1090/s0002-9939-1961-0120352-5. MR 0120352.
  • Wilf, Herbert S. (1961). "The argument of an entire function". Bull. Amer. Math. Soc. 67 (5): 488–489. doi:10.1090/s0002-9904-1961-10649-6. MR 0131549.
  • Wilf, H. S. (February 1961). "The Possibility of Tschebycheff Quadrature on Infinite Intervals". Proc Natl Acad Sci U S A. 47 (2): 209–213. Bibcode:1961PNAS...47..209W. doi:10.1073/pnas.47.2.209. PMC 221658. PMID 16590820.
  • Szekeres, G.; Wilf, Herbert S. (January 1968). "An inequality for the chromatic number of a graph". Journal of Combinatorial Theory. 4 (1): 1–3. doi:10.1016/S0021-9800(68)80081-X.
  • 1971: (editor with Frank Harary) Mathematical Aspects of Electrical Networks Analysis, SIAM-AMS Proceedings, Volume 3,American Mathematical Society MR0329788
  • 1998: (with N. J. Calkin) "The Number of Independent Sets in a Grid Graph", SIAM Journal on Discrete Mathematics

Books edit

Lecture notes edit

  • East Side, West Side
  • Lectures on Integer Partitions
  • Lecture Notes on Numerical Analysis (with Dennis Deturck)

See also edit

References edit

  1. ^ "In Memoriam: Herbert S. Wilf". Math.upenn.edu. 1931-06-13. Archived from the original on 2012-01-20. Retrieved 2012-01-14.
  2. ^ Wilf, Herbert S.; Zeilberger, Doron (1990). "Rational functions certify combinatorial identities". Journal of the American Mathematical Society. 3 (1): 147–158. doi:10.1090/S0894-0347-1990-1007910-7. ISSN 0894-0347.
  3. ^ Hayman, W. K. (1991). "Review: Generatingfunctionology, by H. S. Wilf". Bull. Amer. Math. Soc. (N.S.). 25 (1): 104–106. doi:10.1090/s0273-0979-1991-16036-2.
  4. ^ Ricardo, Henry (April 22, 2006). "Review of generatingfunctionology, 3rd edition". MAA Reviews, Mathematical Association of America.
  5. ^ Whitehead Jr., Earl Glen (1976). "Book Review: Combinatorial algorithms". Bulletin of the American Mathematical Society. 82 (6): 870–872. doi:10.1090/S0002-9904-1976-14187-0. ISSN 0002-9904.

External links edit