A novel algorithm for solution of a combinatory set partitioning problem

Abstract

A novel efficient algorithm for solution of the problem of equal partitioning of a set with predefined weights of elements is proposed. The algorithm is based on calculation of a linear group preserving an invariant: the set of zeros of a cubic form. Algorithms for solution of related problems, including the problem of the search for the second solution if the first solution is known, are discussed.