32 research outputs found
Conway Groupoids and Completely Transitive Codes
To each supersimple design \De one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid which is constructed from .
We show that \Sp_{2m}(2) and 2^{2m}.\Sp_{2m}(2) naturally occur as Conway groupoids associated to certain designs. It is shown that the incidence matrix associated to one of these designs generates a new family of completely transitive -linear codes with minimum distance 4 and covering radius 3, whereas the incidence matrix of the other design gives an alternative construction of a
previously known family of completely transitive codes.
We also give a new characterization of and prove that, for a fixed there are finitely many Conway groupoids for which the set of morphisms does not contain all elements of the full alternating group
Conway groupoids, regular two-graphs and supersimple designs
A design is said to be supersimple
if distinct lines intersect in at most two points. From such a design, one can
construct a certain subset of Sym called a "Conway groupoid". The
construction generalizes Conway's construction of the groupoid . It
turns out that several infinite families of groupoids arise in this way, some
associated with 3-transposition groups, which have two additional properties.
Firstly the set of collinear point-triples forms a regular two-graph, and
secondly the symmetric difference of two intersecting lines is again a line. In
this paper, we show each of these properties corresponds to a group-theoretic
property on the groupoid and we classify the Conway groupoids and the
supersimple designs for which both of these two additional properties hold.Comment: 17 page
Some examples related to Conway Groupoids
We discuss the recently introduced notion of a Conway Groupoid. In particular we consider various generalisations of the concept including infinite analogues
Some examples related to Conway Groupoids and their generalisations
We discuss the recently introduced notion of a Conway Groupoid. In particular
we consider various generalisations of the concept including infinite analogues
Generating groups using hypergraphs
To a set B of 4-subsets of a set Ī© of size n, we introduce an invariant called the āhole stabilizerā which generalizes a construction of Conway, Elkies and Martin of the Mathieu group M12 based on Lloyd's ā15-puzzleā. It is shown that hole stabilizers may be regarded as objects inside an objective partial group (in the sense of Chermak). We classify pairs (Ī©,B) with a trivial hole stabilizer, and determine all hole stabilizers associated to 2-(n,4,Ī») designs with Ī»ā©½2ā