11 papers · 1 filter
Symmetries of regular -graphs
Daniel R Hawtin, Padraig Ó Catháin
Given a finite vector space , the -analogue of a graph, called a -graph, is a pair , where is the set of -dime…
Alphabet-affine 2-neighbour-transitive codes
Daniel R. Hawtin
A code is a subset of the vertex set of a Hamming graph , and is -neighbour-transitive if the automorphism group $G={\rm Aut}({\mathcal C})…
Group actions on codes in graphs
Daniel R. Hawtin, Cheryl E. Praeger
This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance re…
Transitive -fold packings of
Daniel R. Hawtin
A -fold packing of a projective space is a collection of line-spreads such that each line of occurs in precisely spreads in $\mat…
An explicit construction for large sets of infinite dimensional -Steiner systems
Daniel R. Hawtin
Let be a vector space over the finite field . A -Steiner system, or an , is a collection of -dimensional subspaces of such t…
Neighbour-transitive codes in Kneser graphs
Dean Crnković, Daniel R. Hawtin, Nina Mostarac +1
A code is a subset of the vertex set of a graph and is -neighbour-transitive if its automorphism group acts transitively on each of the first parts…