Misplaced Pages

Randall Dougherty

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
American mathematician
Randall Dougherty
Randall Dougherty taking a swim 2009
Born1961 (age 63–64)
NationalityAmerican
Alma materUniversity of California, Berkeley
Scientific career
FieldsMathematics
InstitutionsOhio State University
Doctoral advisorJack 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.

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. He is also a three-time Putnam Fellow (1978, 1979, 1980). Dougherty earned his Ph.D. in 1985 at University of California, Berkeley under the direction of Jack Silver.

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. With Chris Freiling and Ken Zeger, he showed that linear codes are insufficient to gain the full advantages of network coding.

Selected publications

References

  1. "Universität Trier: DBLP Bibliography Server"
  2. Randall Dougherty's results at International Mathematical Olympiad
  3. "The Mathematical Association of America's William Lowell Putnam Competition"
  4. *Randall Dougherty at the Mathematics Genealogy Project
  5. "The Ohio State University Department of Mathematics--Alumni News"
  6. Dougherty, Freiling, and Zeger. Insufficiency of Linear Coding in Network Information Flow. and


Flag of United StatesScientist icon

This article about an American mathematician is a stub. You can help Misplaced Pages by expanding it.

Categories: