Algorithms for difference families in finite abelian groups
副标题:
题目: Algorithms for difference families in finite abelian groups
报告人: Ilias S. Kotsireas (Department of Physics and Computer Science, Wilfrid Laurier University)
时间地点: 2019.02.21 15:00pm N109
摘要: We generalize a number of tools and theorems to search for difference families in cyclic groups, to the more general setting of arbitrary finite abelian groups. In particular, these include the power spectral density (PSD) test and the method of compression. Some illustrative examples will be presented, using Maple's GroupTheory package. This is joint work with Dragomir Z. Djokovic (University of Waterloo) pre-publication available at: https://arxiv.org/abs/1801.07627