Torin Greenwood

I am a combinatorialist in the North Dakota State University math department.  I specialize in analytic combinatorics, where I use generating functions to find asymptotics for sequences of numbers.  In particular, multivariate generating functions can count objects while also tracking parameters of interest.  A primary goal in the Analytic Combinatorics in Several Variables Project is to automate the procedure of starting with a combinatorial description of a counting problem and ending with an asymptotic expression for the sequence.

Beyond asymptotics via generating functions, I am also interested in other problems requiring asymptotic analyses.  Recent projects include finding optimal colorings of the integers that best avoid monochromatic arithmetic progressions, and deriving variance bounds for Euclidean first-passage percolation.  Additionally, I've used these asymptotic tools to analyze RNA folding algorithms, in particular to identify challenges in predicting bimodal distributions of RNA structures.

Contact information:

Department of Mathematics 

North Dakota State University 

Minard 406G 

1210 Albrecht Boulevard 

Fargo, ND 58102 

E-mail: torin-dot-greenwood-at-ndsu-dot-edu