An algorithm for enumerating difference sets

DOI10.2140/JSAG.2019.9.35MaRDI QIDQ2325366zbMATH OpenOpenAlexWikidataFDO

Authors Dylan Peifer

Publication date 25 September 2019

Published in The Journal of Software for Algebra and Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.02194

zbMATH Keywords

gapdifference setsexhaustive search

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Abstract: The DifSets package for GAP implements an algorithm for enumerating all difference sets in a group up to equivalence and provides access to a library of results. The algorithm functions by finding difference sums, which are potential images of difference sets in quotient groups of the original group, and searching their preimages. In this way, the search space can be dramatically decreased, and searches of groups of relatively large order (such as order 64 or order 96) can be completed.

Recommendations

• An algorithm for optimal difference systems of sets
• An algorithm for the difference between set covers
• Enumeration of difference graphs
• scientific article; zbMATH DE number 4091487
• scientific article; zbMATH DE number 3995652
• Algorithms for Constructing Computably Enumerable Sets
• Differences of Computably Enumerable Sets
• scientific article; zbMATH DE number 1694753
• About the enumeration algorithms of closed sets
• A technique for constructing divisible difference sets

Cites work

• scientific article; zbMATH DE number 6374016 (Why is no real title available?)
• A Theorem in Finite Projective Geometry and Some Applications to Number Theory
• A summary of noncylic difference sets, \(k<20\)
• A unifying construction for difference sets
• Construction of strongly regular graphs using affine designs
• Finding the smallest image of a set
• Non-abelian Hadamard difference sets
• On the existence of difference sets in groups of order 96
• Variations on a scheme of McFarland for noncyclic difference sets

Cited in

(2)

• Computational methods for difference families in finite abelian groups
• Constructions of difference sets in nonabelian 2-groups

This page was built for publication: An algorithm for enumerating difference sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2325366)