Jason Semeraro

most citedConway groupoids and completely transitive codes

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

collaborators

3 papers

math.CO2014

Bounding the Number of Hyperedges in Friendship $r$ -Hypergraphs

Karen Gunderson, Natasha Morrison, Jason Semeraro

For $r \geq 2$ , an $r$ -uniform hypergraph is called a friendship $r$ -hypergraph if every set $R$ of $r$ vertices has a unique 'friend' - that is, there exists a unique vertex $x \no…

math.GR2014

Centralizers of normal subgroups and the $Z^{*}$ -Theorem

Ellen Henke, Jason Semeraro

Glauberman's $Z^{*}$ -theorem and analogous statements for odd primes show that, for any prime $p$ and any finite group $G$ with Sylow $p$ -subgroup $S$ , the centre of $G/O_{p^\prime}(…

math.GR2014★ 2 cited

Conway groupoids and completely transitive codes

Nick Gill, Neil I. Gillespie, Jason Semeraro

To each supersimple $2 - (n, 4, λ)$ design $D$ one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated…

Bounding the Number of Hyperedges in Friendship r-Hypergraphs

Centralizers of normal subgroups and the Z∗-Theorem

Conway groupoids and completely transitive codes

Bounding the Number of Hyperedges in Friendship $r$ -Hypergraphs

Centralizers of normal subgroups and the $Z^{*}$ -Theorem