Welcome to the Math Department

Use the navigation menu on the left to browse around the site!

Announcements

See us on Facebook!

DROP/ADD: Spring 2018 drop/add begins November 25, 2017. If you tried to course request an undergraduate math course and received an honors restriction, a major or level restriction, or a prerequisite error, please complete the Math Spring 2018 Drop/Add Survey. Students who receive a closed section error should continue to try to add themselves to a section of the course. We will open seats, as sections fill up, periodically until the start of the semester. All available seats will open on Thursday, January 18, 2018.

CREDIT-BY-EXAM: Sign-up times for credit-by-exam, end of Fall 2017
MONDAY, December 11, 10:00 AM - 11:30 AM and 1:30 PM - 3:00 PM
TUESDAY, December 12, 10:00 AM - 11:00 PM and 1:30 PM - 3:00 PM
WEDNESDAY, December 13, 10:00 AM - 11:00 PM and 1:30 PM - 3:00 PM

Fall 2017 Credit by Exam Information

New Change of Major Policy. Next Open Period: December 18,2017 - January 26, 2018

Tenure-track cryptography / cryptanalysis search

Tenure-track high performance computational mathematics search

Tenure-track quantum information search

graphic

Featured Research

Nick Loehr - Dr. Loehr's research areas are bijective and algebraic combinatorics. The main problem in bijective combinatorics is to prove that two finite sets have the same size by exhibiting a specific one-to-one correspondence between them. Some of the most elegant proofs in mathematics occur in this field. The illustration depicts a colored, directed tree growing around a cylinder. This tree appears in a bijective proof of a recently discovered identity in the theory of integer partitions.

Algebraic combinatorics deals with the interplay between combinatorics and certain areas of abstract algebra, including representation theory, symmetric functions, Lie algebras, and algebraic geometry. An intricate combinatorial calculus has been developed for computing with symmetric functions and related constructs by drawing and operating on suitable pictures of partitions, tableaux, parking functions, lattice paths, etc. Quantum analogues of these combinatorial objects lead to deep results about Macdonald polynomials, the Bergeron-Garsia nabla operator, Hilbert schemes, and more.