13 citations · 27 across the 24 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2017
The cycle polynomial of a permutation group
Peter J. Cameron, Jason Semeraro
The cycle polynomial of a finite permutation group is the generating function for the number of elements of with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},…
math.CO2015
Tournaments, 4-uniform hypergraphs, and an exact extremal result
Karen Gunderson, Jason Semeraro
We consider -uniform hypergraphs with the maximum number of hyperedges subject to the condition that every set of vertices spans either or exactly hyperedges and giv…
math.CO2014
Bounding the Number of Hyperedges in Friendship -Hypergraphs
Karen Gunderson, Natasha Morrison, Jason Semeraro
For , an -uniform hypergraph is called a friendship -hypergraph if every set of vertices has a unique 'friend' - that is, there exists a unique vertex $x \no…