3 citations · 3 across the 6 of their papers we have counts for
5 papers · 1 filter
Uniqueness and explicit computation of mates in near-factorizations
Donald L. Kreher, William J. Martin, Douglas R. Stinson
We show that a "mate'' of a set in a near-factorization of a finite group is unique. Further, we describe how to compute the mate very efficiently using an…
Near-factorizations of dihedral groups
Donald L. Kreher, Maura B. Paterson, Douglas R. Stinson
We investigate near-factorizations of nonabelian groups, concentrating on dihedral groups. We show that some known constructions of near-factorizations in dihedral groups yield equ…
Strong External Difference Families and Classification of -valuations
Donald L. Kreher, Maura B. Paterson, Douglas R. Stinson
One method of constructing -SEDFs (i.e., strong external difference families) in makes use of -valuations of complete bipartite graphs $K_{…
Nestings of BIBDs with block size four
Marco Buratti, Donald L. Kreher, Douglas R. Stinson
In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the \emph{nested point}) to every block of a -BIBD in such a way that we end up with…
On min-base palindromic representations of powers of 2
Donald L. Kreher, Douglas R. Stinson
A positive integer is \emph{palindromic in the base } when , ,and , Focusing on powers of 2, we investig…