Clifford D. Smyth www-math.cmu.edu/ csmyth

Transcription

1 Clifford D. Smyth www-math.cmu.edu/ csmyth MIT Department of Mathematics Room Cambridge, MA Education May 1993 May 1992 Ph.D. in Mathematics, Rutgers University, advisor Michael Saks M.S. in Mathematics, Stevens Institute of Technology B.S. in Mathematics, Stevens Institute of Technology High Honors with a Minor in English and American Literature Employment Instructor in Applied Mathematics, MIT Zeev Nehari Visiting Assistant Professor, Carnegie Mellon University Member, Institute for Advanced Study Research Combinatorial probability: van den Berg-Kesten conjecture, Rudich s conjecture, minimal description length/anti-ramsey number/chromatic number/vertex identifying codes of random graphs, random intersecting families. Computational complexity: hardness of approximation, boolean function complexity. Discrete geometry: equilateral sets, line arrangements. Algebraic combinatorics: how many ways to make a surface of fixed genus by identifying sides of a polygonal disk, when only certain pairs of sides are allowed to be identified? Mathematical Subject Classifications: 05, 52, 60, 68. Talks Reimer s inequality and Rudich s conjecture DIMACS, April 1999 Discrete Math Seminar, Princeton University, April 1999 Prague Combinatorial Workshop, July 1999 Random Structures and Algorithms Conference, Poznan, Poland, August 1999 MIT, February 2000 Microsoft Theory Group, April 2000 University of Washington, April 2000 Conference on Computational Complexity, Florence, Italy, July 2000 Rutgers University, September 2000 Combinatorics Seminar, Ohio State University, April 2001 Institute for Advanced Study, October 2001 ACO Seminar, Carnegie Mellon University, November 2001 Reimer s inequality and Tardos conjecture 1

2 STOC Montreal, May 2002 DIMACS/Rutgers University, March 2002 Equilateral sets in l n p DIMACS/Rutgers University, November 2000 Institute for Advanced Study, February 2001 NYU Geometry Seminar, October 2001 The hardness of 3-uniform hypergraph coloring Theory Seminar, Carnegie Mellon University, November 2002 Logic Seminar, Carnegie Mellon University, January 2003 Long monotone paths in line arrangements ACO Seminar, Carnegie Mellon University, October 2002 Microsoft Research, March 2003 Colloquium, George Washington University, April 2005 Anti-Ramsey Problems Combinatorics Seminar, Ohio State University, February 2003 AMS Sectional Prob. Paradigms in Combinatorics, Newark, DE, April 2005 Combinatorics Seminar, MIT, Novermber, 2005 Random intersecting families Combinatorics Seminar, Ohio State University, April 2005 Permutation Sum Sets ACO Seminar, CMU, March 2005 Combinatorics Seminar, George Washington University, April 2005 Positions/Awards/Fellowships Rutgers University Graduate School Research Award Rutgers Math Department Chair s Teaching Award 2000 Research Assistantship, Rutgers University Summer 1999 Visitor, DIMATIA/Charles University 1999, 2000 Summer Research Support, DIMACS GAANN Fellowship, Rutgers University Summer 1992 Research Assistantship, Brookhaven National Labs Selected Professional Activities Co-organizer: Joint Waterloo-CMU Conference in Extremal Graph Theory, May Organizer: ACO Seminar, Carnegie Mellon University, Mathematical Challenges of the 21st Century, UCLA, August 2000 Graduate School in Computational Complexity Theory, IAS, July August 2000 Organizer: Graduate Student Seminar, Rutgers University,

3 Extremal Combinatorics Workshop, MSRI, November 1996 Referree: JCT A, Discrete and Computational Geometry, STOC, Journal of Alg, MR Member: AMS, MAA Undergraduate Research and Teaching Advisor: Summer research project: Isomorph-free generation of posets, Mike Anderson, MIT, Mentor: Developed topics for three undergraduate research projects, one in number theory for Jason LaRue, the others in algebraic methods in combinatorics: Charmain Sia (Davenport Constant), Shinn Yih Huang (hourglass conjecture). Assisted the graduate student advsiors, Amanda Redlich, Hodi Bidkhori, MIT, summer 2005, Advisor: Developed and mentored four undergraduate research projects in combinatorial game theory: Casandra King, Amy Schollmeyer, Heidi Shaw, Shelby Wilson. Summer Undergraduate Applied Mathematics Institute, CMU Advisor: M.S. Thesis A Study of Combinatorial Games, David Howard, CMU, Extensive experience with successfully incorporating workshops, peer mentoring, graphing calculators, Mathematica, Maple, computer presentations, and student research into undergraduate mathematics education at MIT, CMU, and Rutgers. Teaching History Instructor in Applied Mathematics, MIT Graduate: Prob. Methods in Combinatorics, Alg. Methods in Combinatorics Undergraduate: Discrete Math for CS, Honors Calculus TA, Intro. to Analysis Visiting Assistant Professor, Carnegie Mellon University Graduate: Discrete Math Undergraduate: Number Th., Graph Th., Combinatorics, Discrete Math, Calc I Rutgers University Summer courses: Multivariable Calculus, Combinatorics, Linear Algebra Teaching Assistant at Rutgers University, , Stevens Inst. of Tech., Calculus I-II, Calculus for Engineering I-II, Honors Calculus I-II, Multivariable Calculus, Honors Multivariable Calculus, Differential Equations Departmental Service Examiner: Optimization Ph.D. qualifier, minor topic in probabilistic methods, Jose Soto, MIT, November Examiner: Number Theory Ph.D. qualifier, minor topic in probabilistic methods, Michael Manapat, MIT, January Examiner: logic Ph.D. qualifier, minor topic in Complexity, Grant Reaber, CMU, June

4 Member: Rutgers Graduate Student/Faculty Liaison Committee, Member: Rutgers committee for graduate course evaluations, Organizer: Math Sciences TA Orientation Panel, August 1996 and August Publications 1. A dual version of Reimer s inequality and a proof of Rudich s conjecture with Kahn, Jeffry; Saks, Michael. Proceedings of the Conference on Computational Complexity, IEEE Computer Society, Los Alamitos, CA, 2000, Equilateral sets in l n p. Discrete and Computational Geometry, under revision. 3. Reimer s inequality and Tardos conjecture. Proceedings of the Symposium on Theory of Computing, ACM, New York, NY, 2002, The hardness of 3-uniform hypergraph coloring with Dinur Irit; Regev, Oded. Proceedings of the Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2002, Long monotone paths in line arrangements with Balogh, József; Regev, Oded; Steiger, William; Szegedy, Mario. Proceding of the Symposium on Computational Geometry, ACM, New York, NY, 2003, Long monotone paths in line arrangements with Balogh, József; Regev, Oded; Steiger, William; Szegedy, Mario. Discrete and Compuational Geometry 32 (2004), no. 2, The hardness of 3-uniform hypergraph coloring with Dinur, Irit; Regev, Oded. Combinatorica 25 (2005), no. 5, Anti-Ramsey Properties of Random Graphs with Bohman, Tom; Frieze, Alan; Pikhurko, Oleg., Journal of Combinatorial Theory B, accepted. 9. First order definability of trees and sparse random graphs with Bohman, Tom; Frieze, Alan; Luczak, Tomasz; Pikhurko, Oleg; Spencer, Joel; Verbitsky, Oleg. Combinatorics Probability and Computing 16 (2007), Codes identifying sets of vertices in random networks with Frieze, Alan; Ruszinkó, Miklós; Martin, Ryan; Moncel, Julian. Discrete Math 307 (2007) no.10, On the chromatic number of random graphs with a fixed degree sequence with Frieze, Alan; Krivelevich, Michael. Combinatorics Probability and Computing 16 (2007) On randomly generated intersecting hypergraphs II with Bohman, Thomas; Frieze, Alan; Martin, Ryan; Ruszinkó, Miklós. Random Structures and Algorithms 30 (2007)

5 13. Some results in Polychromatic Ramsey Theory. with Abraham, Uri; Cummings, James. Journal of Symbolic Logic 72 (2007) no On the variance of Shannon products of graphs with Balogh, Jozsef. Discrete Applied Mathematics, to appear. 15. Reimer s inequality and Rudich s conjecture with Kahn, Jeffry; Saks, Michael. in preparation. 16. Non-crossing matchings compatible with a binary word with Kemp, Todd; Mahlburg, Karl; Rattan, Amarpreet. Manuscripts Permutation sum sets with Coppersmith, Don; Flaxman, Abraham. References Michael Saks (advisor), Rutgers University, [email protected] Jeffry Kahn, Rutgers University, [email protected] Dan Kleitman, MIT, [email protected] Alan Frieze, Carnegie Mellon University, [email protected] Russell Walker (teaching letter), Carnegie Mellon University, [email protected] 5