## Tyler Markkanen

# Tyler Markkanen

- Doctor of Philosophy, University of Connecticut, Storrs, Conn., 2009
- Master of Science, University of Connecticut, Storrs, Conn., 2006
- Bachelor of Science, Rensselaer Polytechnic Institute, Troy, N.Y., 2004

Tyler Markkanen is a mathematician and teacher. His research is in mathematical logic, with a special interest in computability theory and computable model theory. For fun, he likes to sing, perform magic tricks, and play games. After graduate school, Markkanen taught as a tenure-track assistant professor of mathematics at Saint Mary-of-the-Woods College in Terre Haute, Ind. From the fall of 2011 to the spring of 2014, he was a visiting assistant professor of mathematics at Manhattan College in Riverdale, N.Y. He began his work at Springfield College in fall 2014, and says he is loving every minute of it!

- Mathematical Logic
- Computability Theory
- Computable Model Theory

- Precalculus Mathematics
- Calculus I and II
- Geometry
- Discrete Mathematics I and II
- Linear Algebra
- Mathematics Seminar

- Teaching Certification for Mathematics, Grades 7-12 in Connecticut
- Mathematical Association of America
- UConn Logic Group

### Selected Works

### Presentations

- New England Recursion and Definability Seminar (NERDS 21.0), University of Connecticut, Storrs, CT (April 2022). "Perfect Matchings in Graphs and Reverse Mathematics."
- UConn Logic Group, UConn, Storrs, CT (October 2020). "Computing Perfect Matchings in Graphs."
- Association of Symbolic Logic North American Annual Meeting, CUNY Graduate Center, New York, NY (May 2019). "Perfect Matchings in Graphs and Reverse Mathematics."
- Joint Mathematics Meetings, Baltimore, MD (January 2019). Event: MAA Poster Session: Recreational Mathematics: Puzzles, Card Tricks, Games, and Gambling. "Cardinality Puzzles."
- JMM, Atlanta, GA (January 2017). Event: Innovative Teaching through Recreational Mathematics, I (co-coordinated with Matthew Jura and Oscar Levin). "The 'Mathemagical' Classroom."
- Mathematics, Physics, and Computer Science Colloquium - Springfield College, Springfield, MA (November 2015). "There are two errors in the the title of this talk."
- New England Recursion and Definability Seminar (NERDS), Assumption College, Worcester, MA (October 2015). "A-computable graphs."
- Mathematics Department Colloquium - Central Connecticut State University, New Britain, CT (February 2015). "Can computers do math? An introduction to computability theory and effective mathematics."
- Joint Mathematics Meetings, San Diego, TX (January 2015). Event: AMS Session on Mathematical Logic. "Restricting the Turing degree spectra of structures."
- CUNY Logic Workshop, CUNY Graduate Center, New York, NY (May 2014). “The domatic numbers of computable graphs.”
- Joint Mathematics Meetings, Baltimore, MD (January 2014). Event: AMS Session on Logic and Probability. "Highly computable graphs and their domatic numbers."
- Joint Mathematics Meetings, San Diego, CA (January 2013). Event: ASL Contributed Paper Session. "Domatic partitions of computable graphs."
- NERDS, Wellesley College, Wellesley, MA (October 2012). "Domatic partitions of computable graphs."
- Manhattan College Math and CS Seminar, Riverdale, NY (September 2012). "The shortest math talk that cannot be titled in under thirteen words."
- Indiana University Logic Seminar, Bloomington, IN (April 2011). "Separating the Turing degree spectra of countable structures."

### Publications

- "The Computational Strength of Matchings in Countable Graphs" (with Stephen Flood, Matthew Jura, and Oscar Levin). Annals of Pure and Applied Logic, 2022, Volume 173, Issue 8, URL https://doi.org/10.1016/j.apal.2022.103133.
- "Puzzles of Cardinality" (with Oscar Levin). The College Mathematics Journal, 2021, Volume 52, Issue 4, Pages 243-253, URL https://doi.org/10.1080/07468342.2021.1941539.
- "A-Computable Graphs" (with Matthew Jura and Oscar Levin). Annals of Pure and Applied Logic, 2016, Volume 167, Issue 3, Pages 235-246, URL http://dx.doi.org/10.1016/j.apal.2015.11.003.
- "Finding Domatic Partitions in Infinite Regular Graphs" (with Matthew Jura and Oscar Levin). Electronic Journal of Combinatorics, 2015, Volume 22, Issue 3, Article Number P3.39. URL https://doi.org/10.37236/5089.
- "Domatic Partitions of Computable Graphs" (with Matthew Jura and Oscar Levin). Archive for Mathematical Logic, 2014, Volume 53, Pages 137-155, URL https://doi.org/10.1007/s00153-013-0359-2.
- "Separating the degree spectra of structures." Ph.D. dissertation, University of Connecticut, 2009.