will be will defending his Master’s thesis for a Mathematics degree, titled
Abstract: We consider two coloring problems which have a combinatorial flavor. The chromatic number of the plane, , is the least number of colors necessary to color in such a way that no two points at a unit distance apart receive the same color. It is well known that . We begin by discussing the arguments that give these bounds.
The main point the talk considers the problem of whether given any , one can color the positive integers in such a way that for all , the numbers are assigned different colors. Such colorings are referred to as satisfactory. We begin with an example which provides insight into the underlying structure inherent in all satisfactory colorings, present a sufficient condition for guaranteeing the existence of satisfactory colorings, and analyze the resulting structure.
The defense will be held Thursday, October 13, 2011, 2:40-3:30 pm, in Room MP-201. Refreshments will be served in the math lounge at 2:15 pm.