Jacques Verstraete


Department of Mathematics
University of California, San Diego
9500 Gilman Drive
La Jolla California 92093-0112
jacques at ucsd dot edu

Figure\
 1
On a personal note, I recently purchased a home. If you are new faculty or new to the university and searching for a home, I recommend Brant Westfall in the strongest of terms.

Bio of Jacques Verstraete


Here is my CV as a pdf file. I did my undergraduate studies and a masters degree at Natal University. Then I completed Part III of the mathematical tripos (certificate of advanced study in mathematics) with distinction and received my PhD from Cambridge University in the department of pure mathematics and mathematical statistics under the supervision of Andrew Thomason. I did a postdoctoral fellowship in the Theory Group at Microsoft Research and while I was there I did some teaching at the University of Washington and I'm a faculty member in the Department of Combinatorics and Optimization at the University of Waterloo. Right now I'm in the Department of Mathematics and Statistics at McGill University until summer 2007, and from then on I will be in the Department of Mathematics at UCSD (University of California San Diego). I hold an NSERC Discovery Grant, a startup grant and a CFI grant. I was recently awarded a Sloan Fellowship.

The principal research topics in which I am interested are extremal and probabilistic combinatorics, with emphasis on random graphs, probabilistic methods, combinatorial number theory and information theory. This field has grown very rapidly in the last few decades, with an increasing number of applications to other areas in pure mathematics, applied mathematics, and theoretical computer science. My interests lie not only in the inherent combinatorial interest in the solution to problems in these research areas, but also in their applicability to other areas of mathematics and computer science.


:: teaching


I am currently teaching a graduate course entitled probabilistic methods and algorithms at UCSD. In the past I have taught two Advanced Multivariable Calculus at the University of Washington, Calculus 1 courses, Introduction to Graph Theory, and Introduction to Combinatorics, at the University of Waterloo. At McGill University I taught Discrete Structures I and II. I have taught a graduate course in Probabilistic Methods, Combinatorics, Algorithms and Extremal Combinatorics at each of University of Washington, University of Waterloo, McGill University and University of California San Diego.

2002 Advanced Multivariable Calculus | University of Washington
2003 Extremal and Probabilistic Combinatorics | University of Washington with David Wilson
2003-2005 Introduction to Combinatorics | University of Waterloo
2004,2006 Probabilistic Methods | University of Waterloo
2004-2005 Calculus for Math Honours | University of Waterloo
2004 Linear Algebra | University of Waterloo
2005-2006 Introduction to Graph Theory | University of Waterloo
2006 Discrete Structures I | McGill University
2007 Discrete Structures II | McGill University
2007 Probabilistic Methods | McGill University
2007 Probabilistic Combinatorics and Algorithms A | UCSD
2008 Probabilistic Combinatorics and Algorithms B | UCSD


:: students



Andrew Hoefel (Undergraduate 2004)

Ben Seamone (Masters 2005)

Mike Cavers (Masters 2006)

Hamed Shirazi (Masters & PhD 2006)

David Pritchard (PhD 2006)

Ararat Haratunyan (Masters 2007)

Nishum Thain (Masters 2007)

David Azose (Undergraduate 2007)



:: surveys.combinatorics


Concentration of multivariable polynomials, by Van Vu.
Highlights of arithmetic combinatorics, by Terry Tao.
The DE method, by Nick Wormald.
Topological graph theory by Dan Archdeacon.
Survey papers by Laszlo Lovasz.
Survey papers by Tim Gowers.


:: people.Combinatorics


Noga Alon | Bela Bollobas | Tom Bohman | Adrian Bondy | Fan Chung | Peter Dankelmann | Reinhardt Diestel | Alan Frieze | Chris Godsil | Tim Gowers | Ron Graham | Andrew Granville | Ben Green | Ervin Gyori | Jeff Kahn | Peter Keevash | Jeong Han Kim | Janos Korner | Michael Krivelevich | Felix Lazebnik | Imre Leader | Laszlo Lovasz | Jiri Matousek | Colin McDiarmid | Brendan McK ay | Mike Molloy | Dhruv Mubayi | Assaf Naor | Jaroslav Nesetril | Oleg Pikhurkho | Laszlo Pyber | Bruce Reed | Neil Robertson | Vojtech Rodl | Imre Ruzsa | Alex Scott | Paul Seymour | Miklos Simonovits | Vera Sos | Joel Spencer | Benny Sudakov | Endre Szemeredi | Terry Tao | Robin Thomas | Andrew Thomason | Carsten Thomassen | Van Vu | Nick Wormald

:: combinatorial.reference books


Here I'm listing books in combinatorics or related to combinatorics in no particular order, but which I like or seem to refer to fairly often.

Graph Theory
Aigner-Ziegler. Proofs from the book.
Bollobas. Modern graph theory.
Jensen-Toft. Graph coloring problems.
Lovasz. Combinatorial problems and exercises.
Lovasz-Plummer, Michael. Matching theory.
Lovasz-Pelikan-Vesztergombi. Discrete Mathematics - Elementary and beyond.
West. Introduction to graph theory.

Algebraic and enumerative combinatorics
Cameron-van Lint. Designs, graphs, codes and their links.
Chung. Spectral graph theory.
Godsil-Royle. Algebraic graph theory.
Goulden-Jackson. Combinatorial enumeration.
Becker-Weispfenning. Grobner bases.
Horn-Johnson. Matrix analysis.
Stanley. Enumerative combinatorics. I and II.

Probabilistic Combinatorics
Alon-Spencer. The probabilistic method.
Bollobas. Random graphs.
Bollobas-Riorden. Percolation.
Janson-Luczak-Rucinski. Random graphs.
Molloy-Reed. Graph coloring and the probabilistic method.

Discrete and Combinatorial Geometry
Agarwal-Pach. Combinatorial geometry.
Beutelspacher-Rosenbaum. Projective Geometry.
Matousek. Lectures on discrete geometry.
Matousek. Geometric discrepancy.
Ziegler. Lectures on polytopes.

Combinatorial Optimization
Cook-Cunningham-Pulleyblank-Schrijver. Combinatorial Optimization.
Papadimitriou-Steiglitz Combinatorial Optimization : Algorithms and Complexity.
Schrijver, Alexander. Combinatorial optimization.

Combinatorial Number Theory
Guy. Unsolved problems in number theory.
Hardy-Littlewood. Inequalities.
Ingham. The distribution of prime numbers.
Nathanson. Additive number theory and classical bases.
Nathanson. Inverse problems and the geometry of sumsets.
Tao-Vu. Additive combinatorics.
Tenenbaum. Introduction to analytic number theory.
Vaughn. The Hardy-Littlewood circle method.

General Combinatorics
Handbook of combinatorics. I and II. Graham-Grotschel-Lovas eds.
Combinatorics, Paul Erdos is eighty. I and II. Komlos-Simonovits eds.
The mathematics of Paul Erdos. I and II. Graham-Nesetril eds.

Design downloaded from FreeWebTemplates.com
Free web design, web templates, web layouts, and website resources!