Date of Award

January 2016

Degree Type

Open Access Thesis

Degree Name

Master of Arts (MA)

Department

Mathematics and Statistics

First Advisor

Steve Szabo

Department Affiliation

Mathematics and Statistics

Second Advisor

Donald Jason Gibson

Department Affiliation

Mathematics and Statistics

Third Advisor

Patrick J. Costello

Department Affiliation

Mathematics and Statistics

Abstract

Let p1, p2, . . . , pn be pairwise coprime positive integers and let P = p1p2 · · · pn. Let 0,1,...,m−1 be a sequence of m different colors. Let A be an n×mP matrix of colors in which row i consists of blocks of pi consecutive entries of the same color, with colors 0 through m − 1 repeated cyclically. The Monochromatic Column problem is to determine the number of columns of A in which every entry is the same color. A partial solution for the case when m is prime is given.

Included in

Number Theory Commons

Share

COinS