Jeong Han Kim

From Wikipedia, the free encyclopedia

Jeong Han Kim (born July 20, 1962) is a South Korean mathematician specializing in combinatorics and computational mathematics. He studied physics and mathematical physics at Yonsei University, and earned his Ph.D in mathematics at Rutgers University. He was a researcher at AT&T Bell Labs and Microsoft Research, and is currently Underwood Chair Professor of Mathematics at Yonsei University.

He received the Fulkerson Prize in 1997 for his contributions to Ramsey theory.[1] Notices of the AMS describes:[2]

“ Jeong Han Kim's paper solves this sixty-year-old problem by improving the Erdős lower bound to match the upper bound of Ajtai, Komlós, and Szemerédi. The paper is a veritable cornucopia of modern techniques in the probabilistic method; it uses martingales in a sophisticated way to obtain strong larger deviation bounds. ”

He is an outspoken critic of South Korean math education.[3]

[edit] References

  1. ^ Jeong Han Kim, "The Ramsey Number R(3,t) has order of magnitude t^2/log t", Random Structures and Algorithms 7 (1995), 173-207.
  2. ^ Notices of the AMS, Vol. 45, September 1998, p984.
  3. ^ 원리는 잊어버리고 공식만 외우는 세태 (Korean), dongA.com, December 6, 2005. Retrieved on March 31, 2008.

[edit] External links

 This biography of an Asian academic is a stub. You can help by expanding it.