New 2--critical sets in the abelian 2--group
classification
🧮 math.CO
keywords
criticalsetsabeliangroupalgorithmclasscompletesdetermine
read the original 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 completes in a top down manner.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.