Curtis Bright

Dr. Curtis Bright is an Assistant Professor in the School of Computer Science at the University of Windsor. He holds a PhD in Computer Science from the University of Waterloo (2017) and an MMath in Computational Mathematics from the same institution (2004). His research focuses on computer-assisted proofs, automated reasoning, symbolic computation, and discrete mathematics. He leads the MathCheck project, which combines satisfiability checking (SAT) and computer algebra systems (CAS) for mathematical conjectures verification.

**Education:**

• PhD, Computer Science, University of Waterloo (2017)
• MMath, Computational Mathematics, University of Waterloo (2004)

**Research Interests:**

Dr. Bright specializes in automating mathematics, particularly verification and counterexample generation of conjectures, computer-assisted proofs, automated reasoning algorithms, satisfiability checking, and symbolic computation. His work bridges combinatorics, experimental mathematics, and computational algebra. Recent projects include solving Lam’s problem via SAT and exhaustive generation, resolving the abc conjecture’s lower bound, and producing certificates for Ramsey numbers R(3,8) and R(3,9).

**Awards:**

• Jacques Calmet Best Paper Award (2021)
• ACA Early Researcher Award (2022)
• Judges’ Choice Award at Maple Conference (2021)

**Advising & Grants:**

He supervises multiple PhD, MSc, and undergraduate students, including recent graduates Sadman Sakib (MSc), Nahiyan Alamgir (MSc), and Yameen Ajani (MSc). His research has been supported by grants such as 170 CPU years and 20TB storage from DRAC for Kochen-Specker system studies. He co-leads the MathCheck group at Waterloo and the Algorithms & Mathematics group at Windsor.

**Labs/Teams:**

His work is anchored in the MathCheck project and collaborations with institutions like Carleton University and the University of Waterloo. His team develops innovative SAT+CAS methodologies for combinatorial and mathematical challenges.