John Wallbaum in the news:
John did his undergraduate work at Wheaton College in Illinois where he received a B.S in mathematics. He then earned an M.S. and a Ph.D. in mathematics from the University of Notre Dame. After a semester teaching at Valparaiso and a year working in Chicago, John came to EMU in fall 2012. His mathematical interests are in computability theory and abstract algebra. He enjoys sports, especially basketball and fastpitch softball.
B.S., Mathematics, Wheaton College, IL 2005.
M.S., Mathematics, University of Notre Dame 2008.
Ph.D., Mathematics, University of Notre Dame 2010.
“A Delta_2 poset with no positive presentation”, Algebra and Logic 51 (2012), no. 4, 281-284.
“Describing free groups, part II: Pi_4 hardness and no Delta_2
basis” with C. McCoy, Trans. Amer. Math. Soc. 364 (2012), no. 11, 5729-5734.
“Describing free groups” with J. Carson, V.S. Harizanov, J.F. Knight, K. Lange, C. Maher, A. Morozov, C. McCoy, and S. Quinn, Trans. Amer. Math. Soc. 364 (2012), no. 11, 5715-5728.
“The computable embedding problem” with J. Carson, E. Fokina, V.S. Harizanov, J.F. Knight, C. Maher, and S. Quinn, Algebra and Logic 50 (2012), no. 6, 478-493.
“Non-computable Problems” Valparaiso Colloquium, February 2011.
“Bases of Computable Free Groups” Computability in Europe conference (Portugal), June 2010.
“Computability of Free Groups” Ohio State Logic Seminar, March 2010.
“Primitive elements of free groups” Midwest Computability Seminar (University of Chicago),January 2010.
“Index Sets of Free Groups” Mal’tsev Meeting (Novosibirsk, Russia) August 2009.