Daniel Kleitman

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Daniel Kleitman (1967)

Daniel J. Kleitman (born October 4, 1934)[1] is a professor of applied mathematics at MIT. His research interests include combinatorics, graph theory, genomics, and operations research.

Biography[edit]

Kleitman was born in New York, New York in 1934. received his PhD in Physics from Harvard University in 1958 under Nobel Laureates Julian Schwinger and Roy Glauber.[2] He is the "k" in G. W. Peck, a pseudonym for a group of six mathematicians that includes Kleitman. Formerly a physics professor at Brandeis University,[3] Kleitman was encouraged by Paul Erdős to change his field of study to mathematics. Perhaps humorously, Erdős once asked him, "Why are you only a physicist?"[4]

Kleitman joined the applied mathematics faculty at MIT in 1966, and was promoted to professor in 1969.[3]

Kleitman coauthored at least six papers with Erdős, giving him an Erdős number of 1.

He was a math advisor and extra for the film Good Will Hunting.[5] Since Minnie Driver, who appeared in Good Will Hunting, also appeared in Sleepers with Kevin Bacon, Kleitman has a Bacon number of 2. Adding the two numbers results in an Erdős–Bacon number of 3, tied for lowest currently.[6][7]

Selected publications[edit]

  • "On a combinatorial problem of Erdős". Proc. Amer. Math. Soc. 17: 139–141. 1966. MR 0184866. 
  • "On Dedekind's problem: The number of monotone Boolean functions". Proc. Amer. Math. Soc. 21: 677–682. 1969. MR 0241334. 
  • with B. Rothschild: "The number of finite topologies". Proc. Amer. Math. Soc. 25: 276–282. 1970. MR 0253944. 
  • with P. Erdős: "On collections of subsets containing 4-member Boolean algebras". Proc. Amer. Math. Soc. 28: 87–90. 1971. MR 0270924. 
  • with B. Rothschild: "Asymptotic enumeration of partial orders on a finite set". Trans. Amer. Math. Soc. 205: 205–220. 1975. MR 0369090. 
  • with G. Markowsky: "On Dedekind's problem: The number of isotone Boolean functions. II.". Trans. Amer. Math. Soc. 213: 373–390. 1975. MR 0382107. 
  • with B. Rothschild and Joel H. Spencer: "The number of semigroups of order n". Proc. Amer. Math. Soc. 55 (1): 227–232. 1976. MR 0414380. [8]
  • with Gil Kalai: "A quasi-polynomial bound for the diameter of graphs of polyhedra". Bull. Amer. Math. Soc. (N.S.) 26 (2): 315–316. 1992. MR 1130448. 
  • with Noga Alon: "Piercing convex sets". Bull. Amer. Math. Soc. (N.S.) 27 (2): 252–256. 1992. MR 1149871. 
  • with Alex Coventry and Bonnie Berger: "MSARI: Multiple sequence alignments for statistical detection of RNA secondary structure". Proc Natl Acad Sci U S A 101 (33): 12102–12107. 2004. PMC 514400. 

References[edit]

  1. ^ Kleitman, Daniel J in American Men of Science, vol. 4, 2009
  2. ^ Daniel Kleitman at the Mathematics Genealogy Project
  3. ^ a b "MIT Mathematics - Daniel Kleitman". www-math.mit.edu. Retrieved 23 March 2010. 
  4. ^ Peck, G. W. (2002), "Kleitman and combinatorics: a celebration", Discrete Mathematics 257 (2–3): 193–224, doi:10.1016/S0012-365X(02)00595-2, MR 1935723 .
  5. ^ Daniel J. Kleitman, "My Career in the Movies,", Notices of the American Mathematical Society, 45, 502 (April 1998)
  6. ^ Grossman, Jerry. "Items of Interest Related to Erdös Numbers". The Erdös Number Project. Oakland University. Retrieved 13 May 2009. 
  7. ^ "Items of Interest Related to Erdös Numbers". The Erdös Number Project. Oakland University. Retrieved December 29, 2011. 
  8. ^ The 1976 publication The number of semigroups of order n listed 3 co-authors, one of whom is "Bruce R. Rothschild" but this is a typographical error for the correct "Bruce L. Rothschild".

External links[edit]