Jim Geelen

from Wikipedia, the free encyclopedia

James "Jim" F. Geelen is a Canadian mathematician who studies graph theory and matroids .

Geelen studied at Curtin University with a bachelor's degree in 1992 and received his doctorate in 1996 with William H. Cunningham at the University of Waterloo (Matchings, Matroids and Unimodular Matrices). He holds a Canada Research Chair in Combinatorial Optimization at the University of Waterloo, where he has been since 1997.

Since 1999 he has been working with Bert Gerards and Geoff Whittle on the extension of the graph-minor problem (by Neil Robertson , Paul Seymour ) to representable matroids. In 2003 he received the Fulkerson Prize for this with AMH Gerards and Ajai Kapoor . In 2006 he received the Coxeter James Prize . With Gerards and Whittle, among others, he was able to prove a conjecture by Gian-Carlo Rota to characterize those matroids that can be realized over a given finite field.

Fonts (selection)

Besides the work mentioned in the footnotes:

  • with G. Whittle: Inequivalent representations of matroids over prime fields, Adv. in Applied Math., Volume 51, 2013, pp. 1–175
  • with B. Gerards, G. Whittle: On inequivalent representations of matroids over nonprime fields, J. Comb. Theory B, Volume 100, 2010, pp. 740-743
  • with Gerards, Whittle: Excluding a planar graph from GF (q) -representable matroids, J. Comb. Theory B, Volume 97, 2007, pp. 971-998

Web links

Individual evidence

  1. ↑ Jim Geelen in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ↑ For James F. Geelen, AMH Gerards, Ajai Kapoor, The Excluded Minors for GF (4) -Representable Matroids, J. Comb. Theory, Ser. B, Volume 79, 2000, pp. 247-299
  3. ↑ Geelen, Gerards, Whittle, Solving Rota's conjecture, Notices AMS, Volume 61, No. 7, August 2014, p. 737, online
personal data
SURNAME Geelen, Jim
ALTERNATIVE NAMES Geelen, James F.
BRIEF DESCRIPTION Canadian mathematician
DATE OF BIRTH 20th century