Paul Seymour (mathematician)

Paul Seymour (mathematician)


Paul Seymour

Residence Flag of the United States.svg U.S.
Institutions Princeton University

Paul D. Seymour (born July 26, 1950) is a professor of mathematics at Princeton University. His research interest is in discrete mathematics, especially combinatorics, graph theory, and optimization. He was responsible for pioneering breakthroughs on regular matroids and totally unimodular matrices, the four colour theorem, graph minors and structure, the strong perfect graph theorem, the Hadwiger conjecture, and claw-free graphs. He won the Fulkerson Prize in 1979, 1994, 2006 and 2009, the Pólya Prize in 1983 and 2004, and the Ostrowski Prize in 2004, among others.

Contents

Early life

Seymour was born in Plymouth, Devon, England. He was a day student at Plymouth College, and finished first nationwide in the University of Oxford entrance exam. He studied at Exeter College, Oxford, and received several degrees: BA in 1971, MSc in 1972, MA in 1975, and D.Phil in 1975.

Career

He became full professor at Ohio State University, Columbus, Ohio, in 1983. From 1983 until 1996, he was at Bell Labs, then Bellcore (Bell Communications Research) Morristown, New Jersey (now Telcordia Technologies). He became professor at Princeton University in 1996. He is Editor-in-Chief for the Journal of Graph Theory.

Paul Seymour in 2007
(photo from MFO)

Personal life

He married Shelley MacDonald of Ottawa in 1979, and they have two children, Amy and Emily. His brother Leonard W Seymour is Professor of gene therapy at Oxford University.[1]

See also

References

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Paul Seymour — may refer to:*Paul Seymour (basketball) *Paul Seymour (football player) *Paul Seymour (mathematician) …   Wikipedia

  • Paul Cohen (mathematician) — Not to be confused with Paul Cohn. Paul J. Cohen Born April 2, 1934(1934 04 02) Long Branch, New Jersey Died March 23, 2007 …   Wikipedia

  • Seymour (surname) — Seymour is the name or partial name of numerous people, places and companies worldwide. It is thought to derive from the contraction of Saint Maur, a region in northern France [http://www.thinkbabynames.com/name/1/Seymour] . Seymour as a surname… …   Wikipedia

  • Klaus Wagner (mathematician) — Klaus Wagner (March 31, 1910 – February 6, 2000) was a German mathematician. He studied topology at the University of Cologne under the supervision of Karl Dörge, who had been a student of Issai Schur. Wagner received his Ph.D. in 1937, and… …   Wikipedia

  • Seymour Cray — Seymour Roger Cray Born September 28, 1925(1925 09 28) Chippewa Falls, Wisconsin, USA …   Wikipedia

  • P. Seymour — may refer to: Paul Seymour (disambiguation) Paul Seymour (basketball) Paul Seymour (American football) Paul Seymour (mathematician) Phil Seymour This disambiguation page lists articles associated with the same title. If an …   Wikipedia

  • Paul Samuelson — Paul A. Samuelson Neo Keynesian economics Photo taken 1950 (age 35) Born May 15, 1915(1915 05 15) Gary …   Wikipedia

  • Paul Wolfowitz — Infobox Politician name = Paul Wolfowitz birth date = birth date and age|1943|12|22 birth place = Brooklyn, New York, U.S. residence = Chevy Chase, Maryland, U.S. nationality = American religion = Jewish death date = death place = office = 10th… …   Wikipedia

  • Robertson–Seymour theorem — In graph theory, the Robertson–Seymour theorem (also called the graph minor theorem[1]) states that the undirected graphs, partially ordered by the graph minor relationship, form a well quasi ordering.[2] Equivalently, every family of graphs that …   Wikipedia

  • Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”