The partition algebra is a classical example of a diagram algebra that contains many of the other famous combinatorial centralizer algebras as subalgebras. The search for a -analogue of these algebras leads to an investigation of the various coincidences that make the partition algebra combinatorially tractable. This talk gives an introduction to the partition algebra and discusses various ways to break its structure in attempted generalizations.