4 papers
On applications of the clique-adjacency polynomial to arbitrary finite graphs
Jake Rigg, John Bamberg
The clique adjacency polynomial (CAP), introduced by Soicher (2015), provides a powerful method for bounding the clique numbers of edge-regular graphs. In this paper, we extend the…
The synchronisation hierarchy via coherent configurations
John Bamberg, Jesse Lansdown
We describe the spreading property for finite transitive permutation groups in terms of properties of their associated coherent configurations, in much the same way that separating…
Low rank groups of Lie type acting point and line-primitively on finite generalised quadrangles
Vishnuram Arumugam, John Bamberg, Michael Giudici
Suppose we have a finite thick generalised quadrangle whose automorphism group acts primitively on both the set of points and the set of lines. Then must be almost simple.…
Tactical decompositions in finite polar spaces and non-spreading classical group actions
John Bamberg, Michael Giudici, Jesse Lansdown +1
For finite classical groups acting naturally on the set of points of their ambient polar spaces, the symmetry properties of \emph{synchronising} and \emph{separating} are equivalen…