Cummings proposes a program of research in combinatorial set theory. The areas to be investigated include polychromatic Ramsey theory (in both the finite and infinite settings), combinatorial principles such as diamonds and squares, and the structure of uncountable linear orderings with forbidden suborderings. A unifying theme is the tension between compactness and incompactness.

Combinatorial set theory is the study of structured sets, for example graphs, trees and orderings. These sets can be finite or infinite, and historically finite and infinite combinatorics have been rather separate; however recently there have been striking applications of infinitary methods to solve problems about finite sets. Progress in this research program should find applications to set theory, logic, combinatorics and topology.

Agency
National Science Foundation (NSF)
Institute
Division of Mathematical Sciences (DMS)
Type
Standard Grant (Standard)
Application #
0654046
Program Officer
Tomek Bartoszynski
Project Start
Project End
Budget Start
2007-08-01
Budget End
2010-07-31
Support Year
Fiscal Year
2006
Total Cost
$124,036
Indirect Cost
Name
Carnegie-Mellon University
Department
Type
DUNS #
City
Pittsburgh
State
PA
Country
United States
Zip Code
15213