New 2-critical Sets in the Abelian 2-Group

Abstract

In this paper we determine a class of critical sets in the abelian $2$-group that may be obtained from a greedy algorithm. These new critical sets are all $2$-critical (each entry intersects an intercalate, a trade of size $4$) and complete in a top-down manner.