Academics John Arhin - Mathematics Fellow
As a post-doctoral student in the School of Mathematical Sciences at Queen Mary, University of London, John lectured on discrete mathematics and conducted tutorial for students in the science and engineering foundation program. His thesis, On the structure of SOMAs and related partial linear spaces was accepted in October 2006.
John Arhin. Every SOMA(n-2,n) is Trojan. Discrete Mathematics, 2008. http://dx.doi.org/10.1016/j.disc.2008.09.050.
John Arhin. On the structure of 1-designs with at most two block intersection numbers. Designs, Codes and Cryptography, v. 43n. 2-3, p. 103-114, June 2007. http://dx.doi.org/10.1007/s10623-007-9067-4.
John Arhin and M. A. Ollis. Some infinite families of non-Trojan SOMAs. In preparation, 30 pages.
- Combinatorial designs
- Finite partial geometry
- Computational design theory
- Applications of computational group theory to combinatorial designs
B.Sc., University of London, 2000; Ph.D., University of London, 2006; Marlboro College 2008 -