Dr Sergey Kitaev

Reader

Mathematics and Statistics

Personal statement

I am a Reader in Combinatorics in the Department of Mathematics and Statistics. 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.

Expertise

Has expertise in:

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

Prizes and awards

Most cited article published by the Journal of Combinatorial Theory, Series A
Recipient
2018
AMS most cited mathematician by the graduation year
Recipient
2018
Global engagements fund grant of £1013
Recipient
2018
London Mathematical Society grant of £700
Recipient
2018
Strathclyde Teaching Excellence Award 2018
Recipient
2018
EMS grant of £850 to support British Combinatorial Conference 2017
Recipient
2017

More prizes and awards

Publications

On semi-transitive orientability of Kneser graphs and their complements
Kitaev Sergey, Saito Akira
Discrete Mathematics Vol 343 (2020)
https://doi.org/10.1016/j.disc.2020.111909
Counting independent sets in Riordan graphs
Cheon Gi-Sang, Jung Ji-Hwan, Kang Bumtle, Kim Hana, Kim Suh-Ryung, Kitaev Sergey, Mojallal Seyed Ahmad
Discrete Mathematics Vol 343 (2020)
Representing split graphs by words
Chen Herman ZQ, Kitaev Sergey, Saito Akira
Discussiones Mathematicae Graph Theory (2020)
On universal partial words for word-patterns and set partitions
Chen Herman Z Q, Kitaev Sergey
RAIRO - Theoretical Informatics and Applications Vol 54 (2020)
https://doi.org/10.1051/ita/2020004
Lower bounds, and exact enumeration in particular cases, for the probability of existence of a universal cycle or a universal word for a set of words
Chen Herman ZQ, Kitaev Sergey, Sun Brian Y
Mathematics Vol 8 (2020)
https://doi.org/10.3390/math8050778
Distributions of several infinite families of mesh patterns
Kitaev Sergey, Zhang Philip B, Zhang Xutong
Applied Mathematics and Computation Vol 372 (2020)
https://doi.org/10.1016/j.amc.2019.124984

More publications

Teaching

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

Research interests

  • Combinatorics
  • Graph Theory
  • Discrete Analysis
  • Formal Languages 

Professional activities

On k-11-representable graphs
Speaker
30/6/2020
On partially ordered patterns of length 4 and 5 in permutations
Speaker
30/6/2020
Uniform distribution of resources
Speaker
9/3/2020
Enumerative Combinatorics and Applications (Journal)
Peer reviewer
2020
Computational challenges in the theory of word-representable graphs
Speaker
24/5/2019
Equidistributions on planar maps via involutions on description trees
Speaker
10/4/2019

More professional activities

Projects

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
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

More projects

Address

Mathematics and Statistics
Livingstone Tower

Location Map

View University of Strathclyde in a larger map