Welcome to Combinatorics and Optimization The C&O department has 36 faculty members and 60 graduate students. We are intensely research oriented and hold a strong international reputation in each of ...

COMBINATORICS AND OPTIMIZATION CURRENT STUDENTS Combinatorics is the study of discrete structures, and related algorithms. We might be interested in these things for their own sake, or because of ...

Abstract: This chapter contains sections titled: Composition: Some Historical Models, The Celestial Model, The Empirical Model, The Dialectical Model, The Gestalt Model, The Cognitive Model, ...

An illustration of a magnifying glass. An illustration of a magnifying glass.

Prerequisites: Graduate standing or consent of instructor. Many students find this course difficult, so a first-rate math background is highly recommended. See the Review Sheet for material you're ...

Abstract: We show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former distributing ...

This course is an introduction to combinatorics with a focus that includes graph theory. Specific topics covered are enumerative combinatorics up to inclusion-exclusion, the theory of simple graphs, ...

All of the above are deeply inter-related with one-another, and, in a certain sense, are all "isomorphic", exhibiting different manifestations of "the same thing": the Cantor set. There's so much here ...