##
Clifford Smyth

Associate Professor

**Office:** Petty 105 **Email address: **cdsmyth@uncg.edu**Starting year at UNCG: **2008**Office hours:** MW 12:30 p.m. - 1:50 p.m.

#### Education

Ph.D. in Mathematics, Rutgers University (2001)

#### Teaching

**Fall, 2016**

- MAT 115-01 LEC (College Algebra), MW 2:00-3:15, Petty Building 303
- MAT 310-01 LEC (Elementary Linear Algebra), MW 3:30-4:45, Petty Building 217
- MAT 799-05 DTS (Dissertation)

**Summer Session 2, 2017**

- MAT 120-11D WEB (Calculus for Business and the Social Sciences)

#### Research Interests

Combinatorics, Mathematical Biology, Applied Math** Current Students: **James Rudzinski

#### Selected Recent Publications

- James Rudzinski and Clifford Smyth, Equivalent Formulations of the Bunk Bed Conjecture, The North Carolina Journal of Mathematics and Statistics, Vol 2 (2016)
- Karl Mahlburg and Clifford Smyth, Symmetric Polynomials and Symmetric Mean Inequalities. Electronic Journal of Combinatorics (EJC,http://www.combinatorics.org/), Volume 20, Issue 3 (2013), P34.
- Clifford Smyth, The BKR inequalities on finite distributive lattices. Combinatorics, Probability and Computing (CPC), Volume 22, Issue 04, pages 612–626, July 2013.
- Dan Cranston, Clifford Smyth, and Douglas West, Revolutionaries and spies on trees and unicyclic graphs. Journal of Combinatorics, Volume 3, Number 2, pages 195–206, 2012.
- David Howard and Clifford Smyth, Revolutionaries and spies. Discrete Mathematics, Volume 312, Issue 22, pages 3384–3391, 28 November 2012.

#### Brief Bio

Dr. Smyth earned a Ph.D. in 2001 from Rutgers University, advised by Michael Saks. He joined the UNCG faculty in 2008. In the interim, he was a Member of the School of Mathematics at the Institute for Advanced Study from 2001 to 2002, advised by Avi Widgerson, a Zeev Nehari Visiting Assistant Professor at Carnegie Mellon University from 2002 to 2005, advised by Alan Frieze, and an Instructor in Applied Mathematics at MIT from 2005 to 2008 advised By Daniel Kleitman. His research lies in combinatorial probability, computational complexity, and discrete geometry.