On disjoint (v,k,k-1) difference families

From MaRDI portal
Publication:670197

DOI10.1007/S10623-018-0511-4zbMATH Open1407.05037arXiv1705.04844OpenAlexW2825029479MaRDI QIDQ670197FDOQ670197

Marco Buratti

Publication date: 18 March 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: A disjoint (v,k,k1) difference family in an additive group G is a partition of Gsetminus0 into sets of size k whose lists of differences cover, altogether, every non-zero element of G exactly k1 times. The main purpose of this paper is to get the literature on this topic in order, since some authors seem to be unaware of each other's work. We show, for instance, that a couple of heavy constructions recently presented as new, had been given in several equivalent forms over the last forty years. We also show that they can be quickly derived from a general nearring theory result which probably passed unnoticed by design theorists and that we restate and reprove in terms of differences. We exploit this result to get an infinite class of disjoint (v,k,k1) difference families coming from the Fibonacci sequence. Finally, we will prove that if all prime factors of v are congruent to 1 modulo k, then there exists a disjoint (v,k,k1) difference family in every group, even non-abelian, of order v.


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




Recommendations




Cites Work


Cited In (20)





This page was built for publication: On disjoint \((v,k,k-1)\) difference families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670197)