2006 Research Experiences for Undergraduates
Computational Number Theory and Combinatorics
Research Projects


Please note that some of these works are still in progress!

Possible placements of nonattacking chess pieces.

This group consisted of Jolie Baumann, Saretta Goss and Gretchen Zahm and was supervised by Neil Calkin, Kevin James and Jeremy Lyle. They studied configurations of certain chess pieces on boards of varying shapes and dimensions.

REU report


Covering Congruences

This goup consisted of Amina Dozier, Charles Fahringer and Martin Harrison and was supervised by Neil Calkin, Kevin James and Jeremy Lyle. They performed computational investigations of covering congruences. This group developed parallel code to search for covering congrueces with a prescribed smallest modulus and with distinct moduli and proved some elementary results on such covers.

REU Report


Generalizations of the Lang-Trotter Conjecture.

This group consisted of Matthew King, Todd Molnar and Kenny Stauffer and was supervised by Neil Calkin, Bryan Faulkner and Kevin James. They studied a generalization of the Lang-Trotter conjecture to the setting of number fields. They made significant progress toward proving that an average version of this conjecture holds for many number fields.

REU Report


Modular Forms and Partitions

This group consisted of Shirley Law, Philip Lee and Jeanne Radder and was supervised by Neil Calkin, Kevin James and Nathan Drake. They studied the distribution of the values of certain restricted partition functions modulo various small primes.

Preprint
Code and documentation