Jordan D. Webster
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Jordan D. Webster has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Eric Swartz
Department of Mathematics William & Mary Williamsburg VA USA
1 shared publication - James A. Davis
Department of Mathematics and Statistics University of Richmond 23173 Richmond VA USA
1 shared publication - John Polhill
Department of Mathematics Computer Science, and Statistics Commonwealth University of Pennsylvania 17815 Bloomsburg PA USA
1 shared publication - Ken Smith
University of Richmond VA now at Google
1 shared publication - Ken W. Smith
Department of Mathematics and Statistics, Sam Houston State University, Huntsville, USA
1 shared publication
Latest Publications
- Open Access
- 10 July 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (4) , 879-888
New spence difference sets
Spence [9] constructed $$\left( \frac{3^{d+1}(3^{d+1}-1)}{2}, \frac{3^d(3^{d+1}+1)}{2}, \frac{3^d(3^d+1)}{2}\right) $$ -difference sets in groups $$K \times C_3^{d+1}$$ for d any positive integer and K any group of order $$\frac{3^{d+1}-1}{2}$$ . Smith and Webster [8] have exhaustively studied the $$d=1$$ case without requiring that the group have the form listed above and found many constructions. Among these, one intriguing example constructs Spence difference sets in $$A_4 \times C_3$$ by using (3, 3, 3, 1)-relative difference sets in a non-normal subgroup isomorphic to $$C_3^2$$ . Drisko [3] has a note implying that his techniques allow constructions of Spence difference sets in groups with a noncentral normal subgroup isomorphic to $$C_3^{d+1}$$ as long as $$\frac{3^{d+1}-1}{2}$$ is a prime power. We generalize this result by constructing Spence difference sets in similar families of groups, but we drop the requirement that $$\frac{3^{d+1}-1}{2}$$ is a prime power. We conjecture that any group of order $$\frac{3^{d+1}(3^{d+1}-1)}{2}$$ with a normal subgroup isomorphic to $$C_3^{d+1}$$ will have a Spence difference set (this is analogous to Dillon’s conjecture in 2-groups, and that result was proved in Drisko’s work). Finally, we present the first known example of a Spence difference set in a group where the Sylow 3-subgroup is nonabelian and has exponent bigger than 3. This new construction, found by computing the full automorphism group $$\textrm{Aut}(\mathcal {D})$$ of a symmetric design associated to a known Spence difference set and identifying a regular subgroup of $$\textrm{Aut}(\mathcal {D})$$ , uses (3, 3, 3, 1)-relative difference sets to describe the difference set.- 10 July 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (4) , 879-888
Open AccessNew spence difference sets
Spence [9] constructed $$\left( \frac{3^{d+1}(3^{d+1}-1)}{2}, \frac{3^d(3^{d+1}+1)}{2}, \frac{3^d(3^d+1)}{2}\right) $$ -difference sets in groups $$K \times C_3^{d+1}$$ for d any positive integer and K any group of order $$\frac{3^{d+1}-1}{2}$$ . Smith and Webster [8] have exhaustively studied the $$d=1$$ case without requiring that the group have the form listed above and found many constructions. Among these, one intriguing example constructs Spence difference sets in $$A_4 \times C_3$$ by using (3, 3, 3, 1)-relative difference sets in a non-normal subgroup isomorphic to $$C_3^2$$ . Drisko [3] has a note implying that his techniques allow constructions of Spence difference sets in groups with a noncentral normal subgroup isomorphic to $$C_3^{d+1}$$ as long as $$\frac{3^{d+1}-1}{2}$$ is a prime power. We generalize this result by constructing Spence difference sets in similar families of groups, but we drop the requirement that $$\frac{3^{d+1}-1}{2}$$ is a prime power. We conjecture that any group of order $$\frac{3^{d+1}(3^{d+1}-1)}{2}$$ with a normal subgroup isomorphic to $$C_3^{d+1}$$ will have a Spence difference set (this is analogous to Dillon’s conjecture in 2-groups, and that result was proved in Drisko’s work). Finally, we present the first known example of a Spence difference set in a group where the Sylow 3-subgroup is nonabelian and has exponent bigger than 3. This new construction, found by computing the full automorphism group $$\textrm{Aut}(\mathcal {D})$$ of a symmetric design associated to a known Spence difference set and identifying a regular subgroup of $$\textrm{Aut}(\mathcal {D})$$ , uses (3, 3, 3, 1)-relative difference sets to describe the difference set. - Open Access
Spread Construction for (36,15,6) Hadamard Difference Sets
There are exactly 35 inequivalent (36, 15, 6) difference sets in nine groups. Eight of the nine groups have a normal Sylow 3-subgroup. We give a straightforward spread construction which explains the 32 inequivalent difference sets in these eight groups. An interesting variation on this construction provides the three difference sets in the ninth group.
Open AccessSpread Construction for (36,15,6) Hadamard Difference Sets
There are exactly 35 inequivalent (36, 15, 6) difference sets in nine groups. Eight of the nine groups have a normal Sylow 3-subgroup. We give a straightforward spread construction which explains the 32 inequivalent difference sets in these eight groups. An interesting variation on this construction provides the three difference sets in the ninth group.
- Open Access
- 26 October 2012
- Published by Springer Nature in Arabian Journal of Mathematics
- Vol. 2 (1) , 103-114
Reversible difference sets with rational idempotents
- 26 October 2012
- Published by Springer Nature in Arabian Journal of Mathematics
- Vol. 2 (1) , 103-114
Open AccessReversible difference sets with rational idempotents
- 22 November 2011
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 20 (1) , 58-67
Reversible and DRAD difference sets in
The existence of Hadamard difference sets has been a central question in design theory. Reversible difference sets have been studied extensively. Dillon gave a method for finding reversible difference sets in groups of the form (C)2. DRAD difference sets are a newer concept. Davis and Polhill showed the existence of DRAD difference sets in the same groups as Dillon. This article determines the existence of reversible and DRAD difference sets in groups of the form (C)3. These are the only abelian 2‐groups outside of direct products of C4 and (C)2 known to contain reversible and DRAD difference sets. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:58–67, 2012
- 22 November 2011
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 20 (1) , 58-67
Reversible and DRAD difference sets in
The existence of Hadamard difference sets has been a central question in design theory. Reversible difference sets have been studied extensively. Dillon gave a method for finding reversible difference sets in groups of the form (C)2. DRAD difference sets are a newer concept. Davis and Polhill showed the existence of DRAD difference sets in the same groups as Dillon. This article determines the existence of reversible and DRAD difference sets in groups of the form (C)3. These are the only abelian 2‐groups outside of direct products of C4 and (C)2 known to contain reversible and DRAD difference sets. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:58–67, 2012
- 17 June 2011
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 62 (3) , 357-365
Using rational idempotents to show Turyn’s bound is sharp
- 17 June 2011
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 62 (3) , 357-365
Using rational idempotents to show Turyn’s bound is sharp