6 citations · 6 across the 4 of their papers we have counts for
4 papers
Orderly Algorithm to enumerate central groupoids and their graphs
Tim Boykett
A graph has the unique path property UPP_n if there is a unique path of length n between any ordered pair of nodes. This paper reiterates Royle and MacKay's technique for construct…
All Difference Family Structures arise from Groups
Tim Boykett
Difference families are traditionally built using groups as their basis. This paper looks at what sort of generalised difference family constructions could be made, using the stand…
Difference Methods and Ferrero Pairs
Tim Boykett, Peter Mayr
We present a construction method of BIB-designs from a finite group G and a group of automorphisms Φon G such that |Φ(x)| = |Φ| for all x in G, x <> 0. By using a generalization of…
Towards a Noether-like conservation law theorem for one dimensional reversible cellular automata
Tim Boykett
Evidence and results suggesting that a Noether--like theorem for conservation laws in 1D RCA can be obtained. Unlike Noether's theorem, the connection here is to the maximal congru…