Search arXiv⌕ Search

arXiv subjects

Struan McCartney

Publications and source records attributed to Struan McCartney.

3 recordsLinked to original sources

Transfer of difference structures: a new semidirect product framework

Difference sets, external difference families and near-factorizations of groups are much-studied structures satisfying certain uniformity conditions on the differences or sums within or between elements of sets in groups. Research has centred on abelian groups, though there are classic results (such as Dillon's Dihedral Trick for difference sets and the work of Pêcher on near-factorizations) connecting abelian and non-abelian structures, which have recently regained attention. We present a new explicit framework enabling transfer of difference structures between groups using a semidirect product approach, establishing new tools and constructions, encompassing various previous results and addressing an open problem of Swartz et al. Motivated by the classic dihedral results, we focus on semidirect products $G \rtimes \mathbb{Z}_2$. Transfer from abelian to non-abelian groups, and between distinct non-abelian groups, are both possible, and our framework can handle $λ$-fold near-factorizations, difference sets and external difference structures with arbitrarily many sets. We obtain new near-factorizations and difference structures in a range of groups, and can transfer various examples not transferrable by previous approaches. We showcase our approach by establishing a new infinite family of three-set abelian circular external difference families, then producing from this the first infinite family of non-abelian circular external difference families.

math.CO↗

Graph labellings and external difference families

Digraph-defined external difference families were recently introduced as a natural generalization of several well-studied combinatorial objects motivated by cryptography (e.g. external difference families (EDFs) and circular external difference families (CEDFs)). In this paper, we develop a systematic framework for using various types of vertex-labellings for graphs and digraphs to create digraph-defined external difference families. The approach is to combine suitable vertex-labellings (generalizations of $α$-valuations, namely near $α$-valuations and oriented near $α$-valuations) with a graph blow-up technique. Many new families are produced, including the first explicit construction for an infinite family of $2$-CEDFs, achieving all parameter sets for $(n,m,l;1)$-$2$-CEDFs with $m \equiv 0 \mod 4$ sets. Further, new results arise for graph labellings themselves (e.g. cyclotomy-based near $α$-valuations for a family of trees without $α$-valuations, and an $α$-valuation for sun graphs).

math.CO↗

Digraph-defined external difference families and new circular external difference families

External difference families (EDFs) are combinatorial objects which were introduced in the early 2000s, motivated by information security applications such as the construction of AMD codes. Various generalizations have since been defined and investigated, in particular strong external difference families (SEDFs) and circular external difference families (CEDFs). In this paper, we present a framework based on graphs and digraphs which offers a new unified way to view these structures, and leads to natural new research questions. We present constructions and structural results about these digraph-defined EDFs, and we obtain new explicit constructions for infinite families of CEDFs, in particular $(ml^2+1,m,l,1)$-CEDFs. Our techniques include cyclotomy in finite fields and direct constructions in cyclic groups and direct products of cyclic groups. We construct the first infinite family of such CEDFs in non-cyclic abelian groups; these have odd values of $m$ and $l$. We also present the first CEDF in a non-abelian group.

math.CO↗