Professor Sergey Kitaev

Mathematics and Statistics

Personal statement

I am Professor of Mathematics in the Department of Mathematics and Statistics and Associate Dean (Research) in the Faculty of Science. I am also Head of the Strathclyde Combinatorics Group. My research interests include, but are not limited to, Combinatorics, Graph Theory, Discrete Analysis, Formal Languages, Optimisation and Satellite Constellations.

Recent research has included studies in the theory of patterns in combinatorial structures and the theory of word-representable graphs. In paritcular, my book Patterns in Permutations and Words, published by Springer (EATCS monographs in Theoretical Computer Science book series) in 2011, is the first comprehensive source over results and trends in the fast-growing field of patterns in permutations and words. My other book Words and Graphs, published by Springer (EATCS monographs in Theoretical Computer Science book series) in 2015, is a comprehansive introduction to the theory of word-representable graphs that I pioneered alone, a field enjoying ever greater attention by other researchers, and with the ultimate goal of finding applications for analysis of algorithms on graphs and robot scheduling. Also, I'm involved in a project on optimal distribution of resources accross a city or a region, and in an investigation of manoeuvrable constellations of small satellites for responsive Earth observation.  

See my personal page for more information.


Has expertise in:

    • Discrete Mathematics
    • Enumerative, Bijective and Algebraic Combinatorics
    • Graph Theory
    • Discrete Analysis
    • Formal Languages

Prizes and awards

Leverhulme Research Fellowship
London Mathematical Society Computer Science Small Grant of £1,200
Scottish Mathematical Sciences Training Centre grant (£8,000)
London Mathematical Society grant of £700
Strathclyde Teaching Excellence Award 2018
AMS most cited mathematician by the graduation year

More prizes and awards


Patterns in permutations and words
Kitaev Sergey
Monographs in Theoretical Computer Science. An EATCS Series Monographs in Theoretical Computer Science. An EATCS Series (2011)
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Bousquet-Melou Mireille, Claesson Anders, Dukes Mark, Kitaev Sergey
Journal of Combinatorial Theory Series A Vol 117, pp. 884-909 (2010)
Crucial words and the complexity of some extremal problems for sets of prohibited words
Evdokimov A, Kitaev Sergey
Journal of Combinatorial Theory Series A Vol 105, pp. 273-289 (2004)
Word problem of the Perkins semigroup via directed acyclic graphs
Kitaev Sergey, Seif Steven
Order Vol 25, pp. 177-194 (2008)
Alternation graphs
Halldorsson Magnus, Kitaev Sergey, Pyatkin Artem
Graph-theoretic concepts in computer science 37th International workshop on graph-theoretic concepts in computer science, 2011 Lecture Notes in Computer Science Vol 6986, pp. 191-202 (2011)
Enumerating (2+2)-free posets by indistinguishable elements
Dukes Mark, Kitaev Sergey, Remmel Jeffrey, Steingrimsson Einar
Journal of Combinatorics Vol 2, pp. 139-163 (2011)

More publications


  • Combinatorics
  • Graph Theory
  • Discrete Mathematics
  • Computability and Complexity
  • Algorithms
  • Business Analytics

Research interests

  • Combinatorics
  • Graph Theory
  • Discrete Analysis
  • Formal Languages 

Professional activities

AMS-MAA joint Meetings
Invited speaker
AMS-MAA joint Meetings
Invited speaker
International Permutation Patterns Conference
Keynote/plenary speaker
Member of the Steering Committee of the Permutation Patterns Conference (Event)
Journal of Discrete Mathematics (Journal)
10th International Conference on Permutation Patterns

More professional activities


Global Engagements: Sergey Kitaev University of California, San Diego (UCSD)
Kitaev, Sergey (Academic)
The main goal of the proposal is to develop a formal agreement on cooperation between the Department of Mathematics at the UCSD and the Computer and Information Sciences Department at Strathclyde.
07-Jan-2014 - 06-Jan-2015
Riordan graphs
Kitaev, Sergey (Principal Investigator)
The theory of Riordan matrices is used to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other families of graphs. The Riordan graphs are proved to have a number of interesting (fractal) properties, which can be useful in creating computer networks with certain desirable features, or in obtaining useful information when designing algorithms to compute values of graph invariants. The main focus of the project is study of structural and spectral properties of families of Riordan graphs obtained from infinite Riordan graphs.
22-Jan-2017 - 21-Jan-2019

More projects


Mathematics and Statistics
Livingstone Tower

Location Map

View University of Strathclyde in a larger map