A. Gregory

collaborators

4 papers

math.GR2019

On Covers of Dihedral 2-Groups by Powerful Subgroups

Risto Atanasov, Adam Gregory, Luke Guatelli +1

A finite $p$ -group $G$ is called \textit{powerful} if either $p$ is odd and $[G, G] \subseteq G^{p}$ or $p = 2$ and $[G, G] \subseteq G^{4}$ . A {\em{cover}} for a group is a collection of su…

math.CO2018

Infinite Families of Asymmetric Graphs

Alejandra Brewer, Adam Gregory, Quindel Jones +2

A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability…

math.CO2018

The Asymmetric Index of a Graph

Alejandra Brewer, Adam Gregory, Quindel Jones +1

A graph $G$ is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963 where they measured the degree of asymmetry…

math.CO2018

Pattern restricted quasi-Stirling permutations

Kassie Archer, Adam Gregory, Bryan Pennington +1

We define a variation of Stirling permutations, called quasi-Stirling permutations, to be permutations on the multiset ${1, 1, 2, 2, \dots, n, n}$ that avoid the patterns 1212 and 21…