Dominic Welsh

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Dominic James Anthony Welsh (born August 29, 1938)[1] is an English mathematician, a professor in the Mathematical Institute of Oxford University. He is an expert in matroid theory,[2] the computational complexity of combinatorial enumeration problems, percolation theory, and cryptography.

Biography[edit]

Welsh obtained his Ph.D. from Oxford University under the supervision of John Hammersley.[3] After working as a researcher at Bell Laboratories, he joined the Mathematical Institute in 1963, and became a fellow of Merton College in 1966. He was given a personal chair in 1992, and retired in 2005.[1]

He chaired the British Combinatorial Society from 1983 to 1987.[1]

Books[edit]

Awards and honours[edit]

Welsh received an honorary doctorate from the University of Waterloo in 2006.[1]

In 2007, Oxford University press published Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh, an edited volume of research papers dedicated to Welsh.

The Russo-Seymour-Welsh estimate in percolation theory is partly named after Welsh.

References[edit]

  1. ^ a b c d Prof Dominic J A Welsh, Debrett's, retrieved 2012-03-11.
  2. ^ Oxley, James (2007), "The contributions of Dominic Welsh to matroid theory", in Grimmett, Geoffrey; McDiarmid, Colin, Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh, doi:10.1093/acprof:oso/9780198571278.003.0015 .
  3. ^ Dominic J. A. Welsh at the Mathematics Genealogy Project
  4. ^ Review of Complexity and Cryptography by J. Rothe (2007), SIGACT News 38 (2): 16–20, doi:10.1145/1272729.1272735.