Using periodicity to obtain partition congruences

In this paper, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our extended technique could be a useful tool to prove congruences for certain types of combinatorial functions based on a bounded number of calculations. As applications of our result, we establish new and existing restricted plane partition congruences, restricted plane overpartition congruences and several examples of restricted partition congruences.