UWA Logo What's On at UWA
   UWA HomeProspective Students  | Current Students  | Staff  | Alumni  | Visitors  | About  |     Search UWA    for      

SEMINAR: Groups and Combinatorics Seminar: 2-Neighbour Transitive Codes in Hamming Graphs

* Login to add events... *
Today's date is Thursday, March 04, 2021
Groups and Combinatorics Seminar: 2-Neighbour Transitive Codes in Hamming Graphs Other events...
Time and place: 15:00 Friday 7 August in Blakers LT.

Speaker: Daniel Hawtin (University of Western Australia)

Title: 2-Neighbour Transitive Codes in Hamming Graphs

Abstract: We consider a code C to be a subset of the vertex set of a Hamming graph, with alphabet Q and entries M. A 1-neighbour is a vertex which is not contained in C, but is distance 1 from some codeword in C. A 2-neighbour is a vertex of the Hamming graph which is distance 2 from some codeword, but not distance 1 or 0 from any codeword. Let X be a subgroup of the automorphism group of the Hamming graph. We say a code C is (X,2)-neighbour transitive if X is transitive on C, the set of 1-neighbours, and the set of 2-neighbours.

Let X_1 be the subgroup of X which fixes the first entry. Gillespie, Giudici and Praeger showed that the action X_1^Q, of X_1 on the alphabet in the first entry, is 2-transitive, and thus affine or almost-simple. In this talk we first address the case where X acts faithfully on M, and then when X_1^Q is almost-simple.
Contact Gabriel Verret <[email protected]>
Start Fri, 07 Aug 2015 15:00
End Fri, 07 Aug 2015 16:00
Submitted by Gabriel Verret <[email protected]>
Last Updated Tue, 01 Sep 2015 17:21
Included in the following Calendars:
Additional Information:
  • Locations of venues on the Crawley and Nedlands campuses are available via the Campus Maps website.
  • Download this event as: Text | iCalendar
  • Mail this event:

Top of Page
© 2001-2010  The University of Western Australia
Questions? Mail [email protected]