A thesis submitted in fulfilment of the requirements for the degree of Masters of Mathematics

Abstract: An open problem introduced by J. Haglund was to find a bijective proof over Dyck paths that would interchange two of its statistics. This problem was known to be The Symmetry Problem of the q,t-Catalan polynomial and was proven by other means to be true. This project is an attempt to find a bijection, where we provide the bijection's behaviour under certain constrains. Then, we introduce an attempt to translate the problem from Dyck paths to other combinatorial structures. Finally we try to solve a related conjecture, called The Symmetry Problem of parking functions, which generalizes the previous problem. Some results we obtained from The Symmetry Problem of parking functions helped us characterize part of a bijective proof for Dyck paths.