Algebra Commons^™

A Dynamic F5 Algorithm, Candice Mitchell

Dissertations

Gröbner bases are a “nice” representation for nonlinear systems of polynomials, where by “nice” we mean they have good computation properties. They have many useful applications, including decidability (whether the system has a solution or not), ideal membership (whether a given polynomial is in the system or not), and cryptography. Traditional Gröbner basis algorithms require as input an ideal and an admissible term ordering. They then determine a Gröbner basis with respect to the given ordering. Some term orderings lead to a smaller basis, but finding them traditionally requires testing many orderings and hoping for better results. A dynamic algorithm …

Assessing The Impact Of A Computer-Based College Algebra Course, Ningjun Ye

Dissertations

USM piloted the Math Zone in Spring 2007, a computer-based program in teaching MAT 101and MAT 099 in order to improve student performance. This research determined the effect of the re-design of MAT 101 on student achievements in comparison to a traditional approach to the same course. Meanwhile, the study investigated possible effects of the Math Zone program on students’ attitude toward studying mathematics.

This study shows that there was no statistically significant difference on MAT101 final exam scores between the Math Zone students and the Classroom students in Fall 2007, Spring 2008 and Fall 2008. At the same time, …