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
- MATH 101 Foundations of Mathematics
- MATH 125 Precalculus
- MATH 142 Calculus II
- MATH 235 Discrete Mathematics I
- MATH 310 Linear Algebra
- MATH 405 Mathematical Analysis
- American Mathematical Society
- Association of Symbolic Logic
- Mathematical Association of America
- University of Connecticut Logic Group
Selected Works
Presentations
- Mathematical Association of America MathFest, Boston, MA (August 2026). Event: Recreational Mathematics, Including Using Games & Puzzles to Enhance Core Math Courses. "A Combinatorial Mathemagic Trick for Liars."
- Association of Symbolic Logic (ASL) North American Annual Meeting, University of Pennsylvania, Philadelphia, PA (July 2026). "Deciding the Density of Computable & C.E. Sets."
- Mathematics Department Colloquium, Central Connecticut State University, New Britain, CT (April 2026). "The Shortest Math Talk Not Titleable in Under Fifty-Five Letters."
- New England Recursion & Definability Seminar (NERDS 27.0), UConn, Storrs, CT (October 2025). "Deciding the Density of Computable & C.E. Sets."
- Indiana University Logic Seminar, Bloomington, IN (April 2023). "Density & Dismantling Orders in Computable Graphs." Online talk.
- NERDS 21.0, UConn, Storrs, CT (April 2022). "Perfect Matchings in Graphs and Reverse Mathematics."
- UConn Logic Group, UConn, Storrs, CT (October 2020). "Computing Perfect Matchings in Graphs." Online talk.
- ASL North American Annual Meeting, CUNY Graduate Center, New York, NY (May 2019). "Perfect Matchings in Graphs & Reverse Mathematics."
- Joint Mathematics Meetings (JMM), Baltimore, MD (January 2019). Event: MAA Poster Session: Recreational Mathematics: Puzzles, Card Tricks, Games & Gambling. "Cardinality Puzzles."
- JMM, Atlanta, GA (January 2017). Event: Innovative Teaching through Recreational Mathematics, I (Co-coordinated with Matthew Jura & Oscar Levin). "The 'Mathemagical' Classroom."
Publications
- "Deciding the Density of Computable and Computably Enumerable Sets" (with Stephen Flood, Matthew Jura & Oscar Levin). Submitted for publication.
- "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.