Profile for Nathan Warnberg

Nathan Warnberg profile photo

TeachingAward badge, 2019

Specialty area(s)

Graph Theory, Matrix Theory, Combinatorics

Brief biography

I grew up in Wisconsin (Barron, WI), am a graduate of the UW system (UW-Platteville), and after a graduate career at Iowa State University I am glad to be back in my home state.

My current mathematics research interests are the interplay between graph theory and matrix theory, a.k.a. combinatorial matrix theory.

I am also very interested in learning theory and applying the theory to my classrooms. This leads to my passion about helping my students become independent learners. So, if you are in one of my classrooms do not be surprised if you end up participating in some different activities!

Current courses at UWL

Math 150 (College Algebra)
Math 207 (Calculus I)
Math 395 (The Art and Craft of Problem Solving)


Ph.D. Mathematics (Physics minor), Iowa State Univesity, 2014.

B.S. Mathematics (Economics minor), University of Wisconsin-Platteville, 2008.

Teaching history

Math 175 (Business Calculus), Math 207 (Calculus I), Math 208 (Calculus II), Math 395 (Calculus and its Origins).

Professional history

Assistant Professor of Mathematics, University of Wisconsin-La Crosse, August 2014 - Present.

Graduate Teaching Assistant, Iowa State University, June 2009 - May 2014.

Lead Teaching Assistant, Iowa State University, May 2012 - May 2013.

Research and publishing


  • Positive semidefinite propagation time. Discrete Applied Math (in press).

  • Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs (with A. Berliner et al.). Involve, a Journal of Mathematics, 8(1), 2015

  • Computing positive semidefinite minimum rank for small graphs (with S. Osborne). Involve, a Journal of Mathematics, 7(5), 2014.

  • Positive semidefinite zero forcing (with J. Ekstrand et al.). Linear Algebra and Applications, 439(7), 2013.


Papers Under Review

  • Rainbow arithmetic progression (with S. Butler et al.)

  • Zero forcing propagation time on oriented graphs (with A. Berliner et al.).