This course is a one-credit seminar on security research across departments at UMass. Each presentation will cover an active research topic at UMass in a way that assumes only a basic background in security. External speakers may also be invited. Note that this course is not intended to be an introduction to cybersecurity, and will not teach the fundamentals of security in a way that would be useful as a foundation for future security coursework. The intended audience is graduate and advanced undergraduate students, as well as faculty. Meets with COMPSCI 591CF and E&C-ENG 591CF.

Cross-listed with CompSci 575. A basic introduction to combinatorics and graph theory for advanced students in computer science, mathematics, and related fields. Topics include elements of graph theory, Euler and Hamiltonian circuits, graph coloring, matching, basic counting methods, generating functions, recurrences, inclusion-exclusion, Polya's theory of counting. Prerequisites: mathematical maturity, calculus, linear algebra, discrete mathematics course such as CompSci 250 or Math 455. Math 411 recommended but not required.

Four to six topics, chosen from fields such as geometry, number theory, and the real numbers, with emphasis on precise def-initions, examples, conjectures, theorems, and proof methods, including induction and contradiction. Prerequisite: MATH 132 or 136 or consent of instructor.

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]

Four to six topics, chosen from fields such as geometry, number theory, and the real numbers, with emphasis on precise def-initions, examples, conjectures, theorems, and proof methods, including induction and contradiction. Prerequisite: MATH 132 or 136 or consent of instructor.

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]

Four to six topics, chosen from fields such as geometry, number theory, and the real numbers, with emphasis on precise def-initions, examples, conjectures, theorems, and proof methods, including induction and contradiction. Prerequisite: MATH 132 or 136 or consent of instructor.

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]

Four to six topics, chosen from fields such as geometry, number theory, and the real numbers, with emphasis on precise def-initions, examples, conjectures, theorems, and proof methods, including induction and contradiction. Prerequisite: MATH 132 or 136 or consent of instructor.

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]

Four to six topics, chosen from fields such as geometry, number theory, and the real numbers, with emphasis on precise def-initions, examples, conjectures, theorems, and proof methods, including induction and contradiction. Prerequisite: MATH 132 or 136 or consent of instructor.

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]

Four to six topics, chosen from fields such as geometry, number theory, and the real numbers, with emphasis on precise def-initions, examples, conjectures, theorems, and proof methods, including induction and contradiction. Prerequisite: MATH 132 or 136 or consent of instructor.

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]

Four to six topics, chosen from fields such as geometry, number theory, and the real numbers, with emphasis on precise def-initions, examples, conjectures, theorems, and proof methods, including induction and contradiction. Prerequisite: MATH 132 or 136 or consent of instructor.

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]

Four to six topics, chosen from fields such as geometry, number theory, and the real numbers, with emphasis on precise def-initions, examples, conjectures, theorems, and proof methods, including induction and contradiction. Prerequisite: MATH 132 or 136 or consent of instructor.

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]