Bijection
Fig: A certain non-crossing matching and its corresponding Catalan-Fuss path below.

Clifford Smyth

I'm an Instructor of Applied Math at MIT. My research interests lie in discrete math, combinatorics, computer science, and combinatorial geometry.

Contact

csmyth "at" math "dot" mit "dot" edu
2-336
(617) 253-6584

 Cliff Smyth

Highlights
2005-07 Instructor in Applied Mathematics, MIT
May 2005 Co-Organizer with Oleg Pikhurko, Waterloo/CMU Extremal Graph Theory Workshop
2003-05 Organizer, ACO Seminar, CMU
2002-05 Zeev Nehari Visiting Assistant Professor, CMU
2001-02 Member, Institute for Advanced Study
May 2001 PhD in mathematics, Rutgers University, advisor Michael Saks
May 2001 Rutgers Math Department Chair's Teaching Award
May 2001 Rutgers University Graduate School Research Award

Job Search

CV
Publication List
AMS Cover Sheet
Research Statement
Teaching Statement

Research

 The conjectures of Rudich, Tardos, and Kusner
PhD Thesis, Rutgers University, 2001.
A dual version of Reimer's inequality and a proof of Rudich's conjecture
with Jeffry Kahn and Michael Saks.
Conference on Computational Complexity, IEEE Computer Society, Los Alamitos, CA, 2000, 98-103.
Equilateral sets in the L^p norm
under revision.
Reimer's inequality and Tardos' conjecture
Proceedings of the Symposium on Theory of Computing, ACM, New York, NY, 2002, 218-221.
The hardness of 3-uniform hypergraph coloring
with Irit Dinur and Oded Regev.
Proc. Foundations of Computer Science, IEEE, Los Alamitos, CA, 2002, 33-40.
Combinatorica 25 (2005), no. 5, 519-535.
Long monotone paths in line arrangements
with Jozsef Balogh, Oded Regev, William Steiger, and Mario Szegedy.
Proceding of the Symposium on Computational Geometry, ACM, New York, NY, 2003, 124-128.
Discrete and Compuational Geometry 32 (2004), no. 2, 167--176.
Anti-Ramsey Properties of Random Graphs
with Tom Bohman, Alan Frieze, and Oleg Pikhurko.
Journal of Combinatorial Theory B, accepted.
First order definability of trees and sparse random graphs
with Tom Bohman, Alan Frieze, Tomasz Luczak, Oleg Pikhurko, Joel Spencer, and Oleg Verbitsky.
Combinatorics Probability and Computing 16 (2007), 375-400.
Codes identifying sets of vertices in random networks
with Alan Frieze, Miklos Ruszinko, Ryan Martin and Julien Moncel.
Discrete Math 307 (2007) no.10, 1094-1107.
On the chromatic number of random graphs with a fixed degree sequence
with Alan Frieze and Michael Krivelevich.
Combinatorics Probability and Computing 16 (2007) 733-746.
On randomly generated intersecting hypergraphs II
with Thomas Bohman, Alan Frieze, Ryan Martin, and Miklos Ruszinko.
Random Structures and Algorithms 30 (2007) 17-34.
Some results in Polychromatic Ramsey Theory
with Uri Abraham and James Cummings.
Journal of Symbolic Logic 72 (2007) no. 3 865-896.
On the variance of Shannon products of graphs
with Jozsef Balogh.
Discrete Applied Mathematics 156 (2008) no.1 110-118.
Reimer's inequality and Rudich's conjecture
with Jeffry Kahn and Michael Saks, in preparation
Non-crossing matchings compatible with a binary word
with Todd Kemp, Karl Mahlburg, and Amarpreet Rattan, in preparation.

Teaching

MIT
18.318 Combinatorial Game Theory (Grad)
06.042 Math for Computer Science (with Albert Meyer)
18.318 Algebraic Methods in Discrete Mathematics (Grad)
18.318 Probabilistic Methods in Discrete Mathematics (Grad)
18.100 Introduction to Analysis
18.022 Multivariable Calculus
CMU
21.701 Discrete Mathematics (Grad)
21.484 Graph Theory
21.441 Number Theory
21.301 Combinatorial Analysis
21.228 Discrete Mathematics
21.120 Calculus I

Co-authors

 Uri Abraham
Thomas Bohman
Jozsef Balogh
James Cummings
Irit Dinur
Alan Frieze
Todd Kemp
Michael Krivelevich
Tomasz Luczak
Karl Mahlburg
Ryan Martin
Oleg Pikhurko
Amarpreet Rattan
Oded Regev
Miklos Ruszinko
Joel Spencer
William Steiger
Mario Szegedy