<!-- This is an automatically generated file. -->
<TitlePage>
<Title>
DifSets
</Title>
<Subtitle>
an algorithm for enumerating all difference sets in a group
</Subtitle>
<Version>
2.3.1
</Version>
<Author>
Dylan Peifer<Alt Only="LaTeX"><Br/></Alt>
<Email>djp282@cornell.edu</Email>
<Homepage>http://www.math.cornell.edu/~djp282</Homepage>
</Author>
<Date>
14 September 2019
</Date>
<Abstract>
The <Package>DifSets</Package> 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.
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. <P/>
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. <P/>
You should have received a copy of the GNU General Public
License along with this program. If not, see
<URL>http://www.gnu.org/licenses/</URL>.
</Copyright>
</TitlePage>
¤ Dauer der Verarbeitung: 0.16 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
