Rainbow Problems in Groups
Dr. Michael Young
Associate Professor of Mathematics – Carnegie Mellon University
A set is considered rainbow if each element of the set is assigned a distinct color. In this talk, we will discuss problems and techniques about determining the minimum number of colors needed in order to guarantee that every coloring of the integers contains a set of integers that is rainbow and a solution to a given equation.