This course introduces students to ideas and techniques from discrete mathematics that are widely used in Computer Science. Students will learn about the fundamentals of propositional and predicate calculus, set theory, relations, recursive structures and counting. This course will help increase students’ mathematical sophistication and their ability to handle abstract problems.

This course is an introduction to the basic concepts of linear algebra, and techniques of matrix manipulation. Topics include linear transformations, Gaussian elimination, matrix arithmetic, determinants, vector spaces, linear independence, basis, null space, row space, and column space of a matrix, eigenvalues, eigenvectors, change of basis, similarity and diagonalization. Various applications are studied throughout the course.

This is a second course in linear algebra that provides an in-depth study of fundamental concepts of the subject. It focuses largely on the effect that a choice of basis has on our understanding of and ability to solve problems with linear operators. Topics include linear transformations, similarity, inner products and orthogonality, QR factorization, singular value decomposition, and the Spectral Theorem. The course includes both computational techniques and the further development of mathematical reasoning skills.

This course will introduce, explain and employ both the classical and modern basic techniques of cryptography. Topics will include the Vignère cipher, affine ciphers, Hill ciphers, one-time pad encryption, Enigma, public key encryption schemes (RSA, Diffie-Hellman, El-Gamal, elliptic curves), and hash functions. The course will include an introduction to algebraic structures and number theoretic tools used in cryptography.

This course provides an introduction to the study of the set of integers and their algebraic properties. Topics include prime factorization and divisibility, linear Diophantine equations, congruences, arithmetic functions, primitive roots, and quadratic residues.

This course covers numerical techniques for the solution of systems of linear equations, eigenvalue problems, singular values and other decompositions, applications to least squares, boundary value problems, and additional topics at the discretion of the instructor.

This course covers basic set theory, number theory, groups, subgroups, cyclic and permutation groups, Lagrange and Sylow theorems, quotient groups, and isomorphism theorems. Group Theory finds applications in other scientific disciplines like physics and chemistry.

This course is a faculty-directed project that could be considered original in nature. The level of work is appropriate for students in their final two years of undergraduate study.

This course is an introduction to the standard results and techniques of number theory. Topics include divisibility, congruences, Diophantine equations, Moebius inversion, quadratic reciprocity, and primitive roots. Cryptography and other applications will be discussed. Projects may be required.

This course is an introduction to the mathematical problems and techniques that serve as a foundation for modern cryptosystems. The topics include: classical cryptosystems computational number theory, primality tests, finite fields, private and public key encryption scheme (RSA, El-Gamal), and applications such as digital signatures, one way functions, and zero knowledge proofs. Use of elliptic curves in cryptography will also be covered.

Masters-level research by the candidate on an appropriate topic as arranged between the candidate and the research advisor.

Independent Study