Exhaustive Search for Minimal Factorizations of Zero-Sum Sequences in Cyclic Groups

This program searches for factorizations of zero-sum sequences in a given cyclic group of even order. It is intended for computational experiments in additive combinatorics. It exhaustively checks all potential factorizations into four minimal parts by iterating over an appropriate product space of weak integer compositions.

See the README distributed with the code for more information.