The Mathematics Department offers a broad, in-depth curriculum for exploring all aspects of mathematics – including quantities, changes, abstraction, structure and space – through small, engaging classroom settings. Within the department there is a great sense of discovery and collaboration as students and faculty are active in research, journal publication, conference presentations, mathematics competitions and many have received distinguished awards and recognition.

Research

is an integral part of the program and is incorporated into coursework as well as ongoing, unique research solutions outside of the classroom. In addition to collaborative research projects with faculty, students are highly active in the Math Club where they have the opportunity to discuss mathematics, solve problems and participate in social activities. A dedicated tutoring facility, great professor accessibility and the encouragement of open discussions in the classroom all contribute to a nurturing and supportive learning environment that lends a deep exploration of mathematics. Graduates are poised to excel in graduate programs and have become highly successful alumni who are skilled educators, actuaries, engineers, financial mathematicians and more.

Mathematics Undergraduate Seminar Series presents two student presentations by Samuel Erickson and Erin Giosta today. Talk 1: Samuel Erickson Pattern avoidance, permutations, and the Wilf-equivalence We will begin with a brief history of pattern avoidance, along with its roots in computer science. We will move on to discuss pattern avoidance in permutations along with Wilf-equivalence. […]

While physics makes heavy use of mathematics compared to other disciplines, most of what a physicist does is closer to advanced arithmetic than pure mathematics. We frequently abuse mathematical concepts and teach our students to do the same in the interest of developing their physical intuition. Ironically, the most useful parts of mathematics are often […]

Lamé’s Theorem is a little known result that describes a beautiful connection between the Fibonacci sequence and the Euclidean Algorithm on the integers. We will describe what this connection is, beginning with what how the Euclidean Algorithm works on the integers. We will end with a preliminary report on current research into an analog of […]

In part I of this series, we introduced formal language theory, focusing on languages that are recognized by simple computational machines called Finite State Automata. In part II, we turn our attention to how Finite State Automata (FSA) can be used to solve computational problems in groups. In particular, we discuss how to decide both […]