An algorithm for enumerating difference sets

DOI10.2140/JSAG.2019.9.35zbMATH Open1420.05025arXiv1807.02194OpenAlexW2950610823WikidataQ127537800 ScholiaQ127537800MaRDI QIDQ2325366FDOQ2325366

Dylan Peifer

Publication date: 25 September 2019

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

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.

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

Recommendations

• An algorithm for optimal difference systems of sets
• An algorithm for the difference between set covers
• Enumeration of difference graphs
• scientific article
• 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

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)

Cites Work

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

Cited In (1)

• 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)