300
Develops the structural concepts that characterize abstract algebra. Topics in this course will be selected from the following: elementary number theory, groups, rings, integral domain, fields, and vector spaces. There is an emphasis on the oral and written communication of mathematical ideas. Students will frequently work in groups on special projects.
Covers both the theory and applications of linear programming, one of the leading methods for large-scale optimization. The simplex method will be studied in detail. Applications include product mix, diet, transportation, and network flow problems. Integer programming will be touched on briefly. Computer tools such as spreadsheet solvers will be introduced and used.
Data science is an interdisciplinary field which blends mathematics, computer science, and various domain-specific fields (such as bioinformatics). The goal is to extract usable information from large sets of data. This course will be an introduction to data science using R, Python or a similar language. Emphasis will be on exploratory data analysis, visualization, model fitting, classification, and prediction.
Computer
Science
Elective
Covers the theory and use of graphs to model relationships between conceptual objects. Topics covered include graph representations, trees, digraphs, and networks, which will delve into the concepts of adjacency matrices, Dijkstra’s algorithm, and spanning trees. Graph coloring and min/max network flow may also be covered.
This courses provides an introduction into the historical and philosophical development of mathematics with particular emphasis on the development of Arithmetic, Algebra, Geometry, and Calculus. Topics and contributions from varied groups and cultures across the world are included. Students will be required to communicate about mathematics and perform non-trivial calculations, using historical techniques appropriate to the level of the prerequisites for this course.
Covers the fundamental algorithms used in both symmetric key and public key cryptography. Algorithms include AES, Diffie-Hellman, RSA, elliptic curve cryptography, as well as cryptographical hash algorithms. Both mathematical foundations and computer implementations will be discussed during the course.
Is a course in finite dimensional vector spaces and linear transformations, including inner product spaces, determinants, eigenvalues, and eigenvectors.
Is designed to teach mathematical science majors the skills necessary to learn mathematics on their own and communicate their knowledge to others in oral and written form. All students will attend presentations made by senior mathematics students. Students will be required to write a short, independently-researched paper and present it to the other students in the junior seminar.
Junior status or permission of instructor
Provides the student with the opportunity to pursue a research project. Students will work on an original mathematics research project by finding and reading background material on a topic and then work to find new results on this topic with the guidance of mathematics faculty.
Notes
This course may be repeated, but only up to 3 credits count towards mathematics major and minor requirements of upper-division electives.
Covers the topics of vector field theory, Fourier series, and partial differential equations.