Document Type

Article

Publication Date

9-2025

Department

Department of Mathematical Sciences

Abstract

One method of constructing (Formula presented.) -SEDFs (i.e., strong external difference families) in (Formula presented.) makes use of (Formula presented.) -valuations of complete bipartite graphs (Formula presented.). We explore this approach and we provide a classification theorem which shows that all such (Formula presented.) -valuations can be constructed recursively via a sequence of “blow-up” operations. We also enumerate all (Formula presented.) -SEDFs in (Formula presented.) for (Formula presented.) and we show that all these SEDFs are equivalent to (Formula presented.) -valuations via affine transformations. Whether this holds for all (Formula presented.) as well is an interesting open problem. We also study SEDFs in dihedral groups, where we show that two known constructions are equivalent.

Publisher's Statement

© 2025 The Author(s). Journal of Combinatorial Designs published by Wiley Periodicals LLC. Publisher’s version of record: https://doi.org/10.1002/jcd.21985

Publication Title

Journal of Combinatorial Designs

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Version

Publisher's PDF

Download

Included in

Mathematics Commons

Share

COinS