Greatest Factorial Factorization in difference fields

Paule's Greatest Factorial Factorization (GFF) for symbolic summation can be considered as the discrete version of Square Free Factorization that is crucial in symbolic integration. While the GFF is well understood for hypergeometric summation, it has not been considered in the more general setting of difference rings. In this master thesis this gap will be closed. In particular, it will be explored up to which level these new ideas may speed up the existing summation algorithms.