In this thesis, we consider several combinatorial topics, belonging to the areas appearing in the thesis title. Given a non-empty complete metric space (X,d), a family of n continuous maps f1,f2,…,fn:X→X is a \emph{contractive family} if there exists λ0 and k∈N, we construct a subset A⊂ZN for some N, such that ∣A2+kA∣≤ϵN, while A−A=ZN. (Here A−A={a1−a2:a1,a2∈A} and A2+kA={a1a2+a1′+a2′+⋯+ak′:a1,a2,a1′,a2′,…,ak′∈A}.) We also prove some extensions of this result. Among other ingredients, the proof also includes an application of a quantitative equidistribution result for polynomials. In the final part, we consider the Graham-Pollak problem for hypergraphs. Let fr(n) be the minimum number of complete r-partite r-graphs needed to partition the edge set of the complete r-uniform hypergraph on n vertices. We disprove a conjecture that f4(n)≥(1+o(1))(2n), by showing that f4(n)≤1514(1+o(1))(2n). The proof is based on the relationship between this problem and a problem about decomposing products of complete graphs, and understanding how the Graham-Pollak theorem (for graphs) affects what can happen here.I would like to thank Trinity College and Department of Pure Mathematics
and Mathematical Statistics for their generous financial support and hospitality during PhD studies