Academic Staff

Dr Christopher Saker PhD

Position in departmentSenior Lecturer in Pure Mathematics
Staff positionDirector of Education and Central Co-ordinator for the Further Maths Support Programme
Telephone01206 872961
Office hoursOpen Door Policy

I first arrived at Essex as an Undergraduate Mathematics students in 1994. Upon completion of my degree he went to Canterbury Christ Church University where I completed a PGCE and went on to teach in a school in London for a year. Two years away from Mathematics however proved to be too long and so I returned to Essex in 1999 as a postgraduate student under the supervision of Prof. Peter Higgins. Since completing my PhD I have been working at the Univeristy of Essex where I won the Student Union 'Apple for the Teacher' Award in 2006, the University of Essex Excellence in Teaching Award in 2010, the 2014 Essex County Council Lecture of the Year Award, I received a Certificate of Excellence from the Pearson National Teaching Awards in 2014 and am a a Principal Fellow of the Higher Education Academy. Today I am a Senior Lecturer and as part of this role I am also a Central Coordinator for the Further Mathematics Support Programme. During the summer I lecture on the Mathematics for Social Scientists course at the Essex Summer School in Social Science Data Analysis. In recent years I hace become increasingly interested in the use of technology in the teaching of mathematics and how I can use it to positive effect on modules I teach,

LinkedIn Profile

Research interests
  • Combinatorics on words, particularly on the study of unavoidable factor sets and related topics.
Teaching responsibilities
  • MA122: Introduction to Computing
  • MA181: Discrete Mathematics
  • MA832: Mathematics Teaching Project
  • Saker, C. J., and Higgins, P. M. (2002). Unavoidable sets of words of uniform length. Information and Computation, 173, 222-226.
  • Penman, B. B. and Saker, C. J. (2003). Counting Minimal n-Unavoidable Sets, Proceedings of WORDS’03, TUCS General Publication No. 27, 110-118.
  • Saker, C. J. and Higgins, P. M. (2006). Unavoidable sets. Theoretical Computer Science, 359, 231-238


<< Back