Given graphs $ X $ and $ Y $ with vertex sets $ V (X) $ and $ V (Y) $ of the same cardinality,
we define a graph $\mathsf {FS}(X, Y) $ whose vertex set consists of all bijections $\sigma: V …

Abstract 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 M 13 …

A $2-(n, 4,\lambda) $ design $(\Omega,\mathcal {B}) $ is said to be supersimple if distinct
lines intersect in at most two points. From such a design, one can construct a certain subset …

Resumen En 1997 John Conway publicó un artículo en el cual describía mediante un
algoritmo tipo “rompecabezas”, definido sobre el plano proyectivo sobre el cuerpo de tres …

We contribute towards the classification programme for Conway groupoids associated to a
$2-(n, 4,\lambda) $ design. Our main results improve the known bounds for a hole stabilizer …

BIROn - Birkbeck Institutional Research Online Page 1 BIROn - Birkbeck Institutional Research
Online Fairbairn, Ben (2016) Some examples related to Conway Groupoids. In: Finite Simple …

BIROn - Birkbeck Institutional Research Online Page 1 BIROn - Birkbeck Institutional
Research Online Fairbairn, Ben (2016) Some examples related to Conway Groupoids and …