Clifford Smyth
Office
Petty 111
Education
Ph.D. Mathematics, Rutgers University, 2001
M.S. Mathematics, Stevens Institute of Technology, 1993
B.S. Mathematics, Stevens Institute of Technology, 1992
Research
Discrete Mathematics
I have applied my discrete mathematics skills to tackle problems arising in the fields of theoretical computer science, discrete geometry, combinatorial probability, probabilistic combinatorics, enumerative combinatorics, algebraic combinatorics, combinatorial games, topological data analysis, machine learning, and certified methods in computational mathematics.
Courses Taught
MAT 253 Discrete Mathematical Structures
MAT 310 Elementary Linear Algebra
Selected Publications
Smooth connectivity in real algebraic varieties. Joseph Cummings, Jonathan D. Hauenstein, Hoon Hong, and Clifford D. Smyth. Numerical Algorithms, 2024.
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.
Approximate Query Complexity. Clifford Smyth. Association for Computing Machinery – Transactions on Computation Theory (TOCT), Volume 3, Number 1, pages 3.1-3.11, 2011.
The dual BKR inequality and Rudich’s conjecture. Jeffry Kahn, Michael Saks, and Clifford Smyth. Combinatorics, Probability, and Computing (CPC), Volume 20, Number 2, pages 257-266, 2011.