John Polhill
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
John Polhill has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Eric Swartz
Department of Mathematics William & Mary Williamsburg VA USA
4 shared publications - James A. Davis
Department of Mathematics and Statistics University of Richmond 23173 Richmond VA USA
4 shared publications - Ken Smith
University of Richmond VA now at Google
4 shared publications - Jordan D. Webster
Mid Michigan College, Harrison, USA
1 shared publication
Latest Publications
- Open Access
Combinatorial transfer: a new method for constructing infinite families of nonabelian difference sets, partial difference sets, and relative difference sets
For nearly a century, mathematicians have been developing techniques for constructing abelian automorphism groups of combinatorial objects, and, conversely, constructing combinatorial objects from abelian groups. While abelian groups are a natural place to start, recent computational evidence strongly indicates that the vast majority of transitive automorphism groups of combinatorial objects are nonabelian. This observation is the guiding motivation for this paper. We propose a new method for constructing nonabelian automorphism groups of combinatorial objects, which could be called the \textit{combinatorial transfer method}, and we demonstrate its power by finding (1) the first infinite families of nonabelian Denniston partial difference sets (including nonabelian Denniston PDSs of odd order), (2) the first infinite family of Spence difference sets in groups with a Sylow 3-subgroup that is non-normal and not elementary abelian, (3) the first infinite families of McFarland difference sets in groups with a Sylow $p$-subgroup that is non-normal and is not elementary abelian, (4) new infinite families of partial difference sets in nonabelian $p$-groups with large exponent, (5) an infinite family of semiregular relative difference sets whose forbidden subgroup is nonabelian, and (6) a converse to Dillon's Dihedral Trick in the PDS setting. We hope this paper will lead to more techniques to explore this largely unexplored topic.
Open AccessCombinatorial transfer: a new method for constructing infinite families of nonabelian difference sets, partial difference sets, and relative difference sets
For nearly a century, mathematicians have been developing techniques for constructing abelian automorphism groups of combinatorial objects, and, conversely, constructing combinatorial objects from abelian groups. While abelian groups are a natural place to start, recent computational evidence strongly indicates that the vast majority of transitive automorphism groups of combinatorial objects are nonabelian. This observation is the guiding motivation for this paper. We propose a new method for constructing nonabelian automorphism groups of combinatorial objects, which could be called the \textit{combinatorial transfer method}, and we demonstrate its power by finding (1) the first infinite families of nonabelian Denniston partial difference sets (including nonabelian Denniston PDSs of odd order), (2) the first infinite family of Spence difference sets in groups with a Sylow 3-subgroup that is non-normal and not elementary abelian, (3) the first infinite families of McFarland difference sets in groups with a Sylow $p$-subgroup that is non-normal and is not elementary abelian, (4) new infinite families of partial difference sets in nonabelian $p$-groups with large exponent, (5) an infinite family of semiregular relative difference sets whose forbidden subgroup is nonabelian, and (6) a converse to Dillon's Dihedral Trick in the PDS setting. We hope this paper will lead to more techniques to explore this largely unexplored topic.
- 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
Nonabelian partial difference sets constructed using abelian techniques
A $(v,k,λ, μ)$-partial difference set (PDS) is a subset $D$ of a group $G$ such that $|G| = v$, $|D| = k$, and every nonidentity element $x$ of $G$ can be written in either $λ$ or $μ$ different ways as a product $gh^{-1}$, depending on whether or not $x$ is in $D$. Assuming the identity is not in $D$ and $D$ is inverse-closed, the corresponding Cayley graph ${\rm Cay}(G,D)$ will be strongly regular. Partial difference sets have been the subject of significant study, especially in abelian groups, but relatively little is known about PDSs in nonabelian groups. While many techniques useful for abelian groups fail to translate to a nonabelian setting, the purpose of this paper is to show that examples and constructions using abelian groups can be modified to generate several examples in nonabelian groups. In particular, in this paper we use such techniques to construct the first known examples of PDSs in nonabelian groups of order $q^{2m}$, where $q$ is a power of an odd prime $p$ and $m \ge 2$. The groups constructed can have exponent as small as $p$ or as large as $p^r$ in a group of order $p^{2r}$. Furthermore, we construct what we believe are the first known Paley-type PDSs in nonabelian groups and what we believe are the first examples of Paley-Hadamard difference sets in nonabelian groups, and, using analogues of product theorems for abelian groups, we obtain several examples of each. We conclude the paper with several possible future research directions.Open AccessNonabelian partial difference sets constructed using abelian techniques
A $(v,k,λ, μ)$-partial difference set (PDS) is a subset $D$ of a group $G$ such that $|G| = v$, $|D| = k$, and every nonidentity element $x$ of $G$ can be written in either $λ$ or $μ$ different ways as a product $gh^{-1}$, depending on whether or not $x$ is in $D$. Assuming the identity is not in $D$ and $D$ is inverse-closed, the corresponding Cayley graph ${\rm Cay}(G,D)$ will be strongly regular. Partial difference sets have been the subject of significant study, especially in abelian groups, but relatively little is known about PDSs in nonabelian groups. While many techniques useful for abelian groups fail to translate to a nonabelian setting, the purpose of this paper is to show that examples and constructions using abelian groups can be modified to generate several examples in nonabelian groups. In particular, in this paper we use such techniques to construct the first known examples of PDSs in nonabelian groups of order $q^{2m}$, where $q$ is a power of an odd prime $p$ and $m \ge 2$. The groups constructed can have exponent as small as $p$ or as large as $p^r$ in a group of order $p^{2r}$. Furthermore, we construct what we believe are the first known Paley-type PDSs in nonabelian groups and what we believe are the first examples of Paley-Hadamard difference sets in nonabelian groups, and, using analogues of product theorems for abelian groups, we obtain several examples of each. We conclude the paper with several possible future research directions. - Open Access
Genuinely nonabelian partial difference sets
Strongly regular graphs (SRGs) provide a fertile area of exploration in algebraic combinatorics, integrating techniques in graph theory, linear algebra, group theory, finite fields, finite geometry, and number theory. Of particular interest are those SRGs with a large automorphism group. If an automorphism group acts regularly (sharply transitively) on the vertices of the graph, then we may identify the graph with a subset of the group, a partial difference set (PDS), which allows us to apply techniques from group theory to examine the graph. Much of the work over the past four decades has concentrated on abelian PDSs using the powerful techniques of character theory. However, little work has been done on nonabelian PDSs. In this paper we point out the existence of \textit{genuinely nonabelian} PDSs, i.e., PDSs for parameter sets where a nonabelian group is the only possible regular automorphism group. We include methods for demonstrating that abelian PDSs are not possible for a particular set of parameters or for a particular SRG. Four infinite families of genuinely nonabelian PDSs are described, two of which -- one arising from triangular graphs and one arising from Krein covers of complete graphs constructed by Godsil \cite{Godsil_1992} -- are new. We also include a new nonabelian PDS found by computer search and present some possible future directions of research.
Open AccessGenuinely nonabelian partial difference sets
Strongly regular graphs (SRGs) provide a fertile area of exploration in algebraic combinatorics, integrating techniques in graph theory, linear algebra, group theory, finite fields, finite geometry, and number theory. Of particular interest are those SRGs with a large automorphism group. If an automorphism group acts regularly (sharply transitively) on the vertices of the graph, then we may identify the graph with a subset of the group, a partial difference set (PDS), which allows us to apply techniques from group theory to examine the graph. Much of the work over the past four decades has concentrated on abelian PDSs using the powerful techniques of character theory. However, little work has been done on nonabelian PDSs. In this paper we point out the existence of \textit{genuinely nonabelian} PDSs, i.e., PDSs for parameter sets where a nonabelian group is the only possible regular automorphism group. We include methods for demonstrating that abelian PDSs are not possible for a particular set of parameters or for a particular SRG. Four infinite families of genuinely nonabelian PDSs are described, two of which -- one arising from triangular graphs and one arising from Krein covers of complete graphs constructed by Godsil \cite{Godsil_1992} -- are new. We also include a new nonabelian PDS found by computer search and present some possible future directions of research.