Research Papers
The Computational Strength of Matchings in Countable Graphs (with Stephen Flood, Matthew Jura, and Oscar Levin). Submitted. (pdf)
Puzzles of Cardinality (with Oscar Levin). The College Mathematics Journal, 2021, Volume 52, Issue 4, Pages 243-253, DOI: 10.1080/07468342.2021.1941539, URL https://doi.org/10.1080/07468342.2021.1941539. (pdf)
A-Computable Graphs (with Matthew Jura and Oscar Levin). Ann. Pure Appl. Logic, 2016, Volume 167, no. 3, Pages 235-246, DOI 10.1016/j.apal.2015.11.003, URL http://dx.doi.org/10.1016/j.apal.2015.11.003. (pdf)
Finding Domatic Partitions in Infinite Regular Graphs (with Matthew Jura and Oscar Levin). Electronic Journal of Combinatorics, 2015, Volume 22, Issue 3, Paper #P3.39. The final publication is available here. (pdf)
Domatic Partitions of Computable Graphs (with Matthew Jura and Oscar Levin). Archive for Mathematical Logic, 2014, Volume 53, Pages 137-155, DOI 10.1007/s00153-013-0359-2. The final publication is available at link.springer.com. (pdf)
Separating the Degree Spectra of Structures. Ph.D. Dissertation, University of Connecticut, 2009. (pdf)
Academic Talks
UConn Logic Group, University of Connecticut, 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. (slides)
Joint Mathematics Meetings, Baltimore, MD (January 2019). Event: MAA Poster Session: Recreational Mathematics: Puzzles, Card Tricks, Games, and Gambling. Cardinality puzzles. (poster)
Mathematics, Physics, and Computer Science Colloquium – Springfield College, Springfield, MA (December 2018). Cardinality Puzzles. (slides)
Joint Mathematics Meetings, Atlanta, GA (January 2017). Event: Innovative Teaching through Recreational Mathematics, I (co-organized with Matthew Jura and Oscar Levin). Title: 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. (slides)
New England Recursion and Definability Seminar (NERDS), Assumption College, Worcester, MA (October 2015). A-Computable graphs. (slides)
Mathematics Department Colloquium – Central Connecticut State University, New Britain, CT (February 2015). Can computers do math? An introduction to computability theory and effective mathematics. (slides)
Joint Mathematics Meetings, San Diego, TX (January 2015). Event: AMS Session on Mathematical Logic. Restricting the Turing degree spectra of structures. (slides)
CUNY Logic Workshop, CUNY Graduate Center, New York, NY (May 2014). The domatic numbers of computable graphs. (slides)
Joint Mathematics Meetings, Baltimore, MD (January 2014). Event: AMS Session on Logic and Probability. Highly computable graphs and their domatic numbers. (slides)
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.
Association for Symbolic Logic 2010 North American Annual Meeting, Washington, D.C. (March 2010). Separating the degree spectra of structures.
Joint Mathematics Meetings, San Francisco, CA (January 2010). Event: AMS Session on Algebras, II. “Separating the degree spectra of structures” and beyond: an overview of my dissertation in computable model theory with some new extensions.
Joint Mathematics Meetings, Washington, D.C. (January 2009). Event: Logic and Computer Science. Separating the degree spectra of structures.
One two-part talk each semester at the Local Student Logic Seminar, UConn (Fall 2006 – Spring 2009). Expository and original research talks in the areas of algorithmic randomness, computable model theory, and computability in linear orders.
Ph.D. Candidacy Oral Exam, UConn (Spring 2008). A model of set theory in which every set of reals is Lebesgue measurable.