Sean Eberhard

activity

20162019

most citedThe trivial lower bound for the girth of

S_{n}

4 citations · 7 across the 2 of their papers we have counts for

collaborators

3 papers

math.GR2019

Association schemes for diagonal groups

Peter J. Cameron, Sean Eberhard

For any finite group $G$ , and any positive integer $n$ , we construct an association scheme which admits the diagonal group $D_{n} (G)$ as a group of automorphisms. The rank of the ass…

math.GR2017★ 4 cited

The trivial lower bound for the girth of $S_{n}$

Sean Eberhard

Consider the Cayley graph of $S_{n}$ generated by a random pair of elements $x, y$ . Conjecturally, the girth of this graph is $Ω (n lo g n)$ with probability tending to $1$ as $n\to\in…

math.NT2016★ 3 cited

The abelian arithmetic regularity lemma

Sean Eberhard

We give a brief exposition and proof of the arithmetic regularity lemma of Green and Tao in the abelian ( $U^{2}$ ) case, over ${1, \dots, N}$ . This may be useful to those who need jus…

Association schemes for diagonal groups

The trivial lower bound for the girth of Sn​

The abelian arithmetic regularity lemma

The trivial lower bound for the girth of $S_{n}$