Randall Dougherty | |
|---|---|
 Randall Dougherty taking a swim 2009 | |
| Born | 1961 (age 62–63) |
| Nationality | American |
| Alma mater | University of California, Berkeley |
| Scientific career | |
| Fields | Mathematics |
| Institutions | Ohio State University |
| Doctoral advisor | Jack Silver |
Randall Dougherty (born 1961) is an American mathematician. Dougherty has made contributions in widely varying areas of mathematics, including set theory, logic, real analysis, discrete mathematics, computational geometry, information theory, and coding theory.[1]
Dougherty is a three-time winner of the U.S.A. Mathematical Olympiad (1976, 1977, 1978) and a three-time medalist in the International Mathematical Olympiad.[2] He is also a three-time Putnam Fellow (1978, 1979, 1980).[3] Dougherty earned his Ph.D. in 1985 at University of California, Berkeley under the direction of Jack Silver.[4]
With Matthew Foreman he showed that the Banach-Tarski decomposition is possible with pieces with the Baire property, solving a problem of Marczewski that remained unsolved for more than 60 years.[5] With Chris Freiling and Ken Zeger, he showed that linear codes are insufficient to gain the full advantages of network coding.[6]
- ^ "Universität Trier: DBLP Bibliography Server"
- ^ Randall Dougherty's results at International Mathematical Olympiad
- ^ "The Mathematical Association of America's William Lowell Putnam Competition"
- ^ *Randall Dougherty at the Mathematics Genealogy Project
- ^ "The Ohio State University Department of Mathematics--Alumni News"
- ^ Dougherty, Freiling, and Zeger. Insufficiency of Linear Coding in Network Information Flow.[1] and [2]