Goto Chapter: Top 1 2 3

DifSets

an algorithm for enumerating all difference sets in a group

2.3.1

14 September 2019

Dylan Peifer
Email: djp282@cornell.edu
Homepage: http://www.math.cornell.edu/~djp282

Abstract

The DifSets Package implements an algorithm for enumerating all difference sets up to equivalence in an arbitrary finite group. 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.

Copyright

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

2.1 The Main Functions

2.1-1 DifferenceSets
2.1-2 DifferenceSums

2.2 Sizes

  2.2-1 PossibleDifferenceSetSizes
  2.2-2 DifferenceSetsOfSizeK
  2.2-3 DifferenceSumsOfSizeK

2.3 Refining