Algorithms for difference families in finite abelian groups
Combinatorics
2024-01-23 v2
Abstract
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular the power density PSD-test and the method of compression can be used to help the search.
Cite
@article{arxiv.1801.07627,
title = {Algorithms for difference families in finite abelian groups},
author = {Dragomir Z. Djokovic and Ilias S. Kotsireas},
journal= {arXiv preprint arXiv:1801.07627},
year = {2024}
}
Comments
18 pages, minor changes