People

Clifford Smyth

Professor

Office: Petty 103
Email: cdsmyth@uncg.edu
Personal Website: https://sites.google.com/view/cliffordsmyth/
Starting year at UNCG: 2008
Office Hours: T R 12:30 p.m. - 1:45 p.m.

Education

Degree(s): Ph.D. in Mathematics, Rutgers University (2001)

Teaching

Fall 2024

• MAT-253 LEC (Discrete Mathematical Structur), TR 11:00-12:15, PETT 217
• MAT-709 LEC (Topics in Computational Math), TR 2:00-3:15, NSCI 240
• MAT-790 IND (Directed Doctoral Research)

Research

Member of the Research Group(s): Combinatorics, Mathematical Biology
Current Students: Eric Hardin (Ph.D.)
Former Students: Eric Hardin (M.A.), Davorin Stajsic (M.A.), Matt Farmer (Ph.D.), James Rudzinski (Ph.D.)

Selected Publications

• Reciprocals of thinned exponential series
  David Galvin, John Engbers, and Clifford Smyth
  Australasian Journal of Combinatorics, Volume 89(1), Pages 61–96, 2024.
• Determinantal formluas with major indices
  Thomas McConville, Donald Robertson, and Clifford Smyth
  Proceedings of the American Mathematical Society 149 (12), 5101-5117, 2021.
• Toporesnet: A hybrid deep learning architecture and its application to skin lesion classification
  Chuan-Shen Hu, Austin Lawson, Jung-Sheng Chen, Yu-Min Chung, Clifford Smyth, and Shih-Min Yang Mathematics 9 (22), 2924, 2021.
• On a rank-unimodality conjecture of Morier-Genoud and Ovsienko
  Thomas McConville, Bruce Sagan, and Clifford Smyth
  Discrete Mathematics 344 (8), 112483, 2021.
• Certified evaluations of H\”older continuous functions at roots of polynomials
  Parker Edwards, Jonathan Hauenstein, and Clifford Smyth
  Communications in Computer and Information Science, 1414, 185-203, 2021.
• Restricted Stirling and Lah numbers and their inverses
  John Engbers, David Galvin, and Clifford Smyth
  Journal of Combinatorial Theory, Series A, 161, 271-298, 2019.

Brief Biography

Dr. Smyth earned his Ph. D. in mathematics in 2001 from Rutgers University, advised by Mike Saks. Afterwards, he held postdoctoral positions at the Institute for Advanced Study, Carnegie Mellon University, and MIT until joining UNCG in 2008. His research interests lie in discrete mathematics, including problems coming from combinatorial probability, theoretical computer science, discrete geometry, and combinatorial enumeration.