Campus Directory
Matthew Devilbiss
| Title: | Assistant Professor |
| Office: | Warde Academic Center |
| Phone: | 773-298-3396 |
| Email: | devilbiss@sxu.edu |
| Department: | Mathematics |
Biography
Matthew DeVilbiss earned his bachelor's degree in mathematics from the University of Dayton and his doctorate in mathematics from the University of Illinois Chicago, where he worked under James Freitag. DeVilbiss's primary area of research is in model theory and its applications to various fields of mathematics such as algebra, combinatorics, and geometry. Prior to SXU, DeVilbiss was a Zassenhaus assistant professor at Ohio State University, where he taught MATH 3345: Foundations of Higher Mathematics, MATH 4547: Introductory Analysis I, and the graduate-level MATH 5051: Introduction to Mathematical Logic.
Education
Ph.D. in Mathematics
University of Illinois Chicago
B.S. in Mathematics
University of Dayton
Areas of Specialization
- Mathematical Logic
- Model Theory
- Differential Algebra
- O-minimality
Courses Taught
- MATH 112: College Algebra
- MATH 201: Calculus with Analytic Geometry I
- MATH 202: Calculus with Analytic Geometry II
- MATH 211: Linear Algebra
- MATH 300: Advanced Calculus
- MATH 309: Abstract Algebra I
Presentations/Publications/Productions
Guy Casale, Matthew DeVilbiss, James Freitag, Joel Nagloo. Strong Minimality of Triangle Functions. Publications mathématiques de Besançon. Algèbre et théorie des nombres. (2026)
Matthew DeVilbiss and James Freitag, Generic differential equations are strongly minimal, Compositio Mathematica 159 (2021), 1387 - 1412.
Matthew DeVilbiss, Bradley Fain, Amber Holmes, Paul Horn, Sonwabile Mafunda, and K. E. Perry. An Extremal Problem on Rainbow Spanning Trees in Graphs. Austrailasian Journal of Combinitorics. 86, no. 1 (2023): 1-23.
Matthew DeVilbiss, Peter Johnson, and Ryan Matzke. Edge Grundy numbers of the regular Turán graphs. Bulletin of the Institute of Combinatorics and its Applications. 84, (2018): 45-52.
Loren Anderson, Matthew DeVilbiss, Sarah Holliday, Peter Johnson, Anna Kite, Ryan Matzke, and Jessica McDonald. The edge Grundy numbers of some graphs. International Journal of Mathematics and Computer Science. 12, no. 1 (2017): 13-26.
Matthew DeVilbiss, Bradley Fain, Peter Johnson, and Ryan Matzke. Note on the secure-domination number of a graph. Bulletin of the Institute of Combinatorics and its Applications. 74 (2015): 113-19.