The goal of this thesis is to attempt to provide a classification of multidimensional per
sistence. We present two main attacks on this problem. First, we examine the relationship
between multidimensional persistence and one dimensional persistence. Second, we attempt
to classify the module by a certain linear map obtained by taking a free resolution of the
multipersistence module. In both cases, we examine the pro’s and con’s of the approach by
providing an illuminating example.