Professor Sergey Kitaev

Mathematics and Statistics

Contact

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. I am an editor of Journal of Combinatorial Theory, Series A (JCTA), Proceedings of the Edinburgh Mathematical Society (PEMS), and Enumerative Combinatorics and Applications (ECA). 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. 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 across 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.

Back to staff profile

Publications

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)
https://doi.org/10.1016/j.jcta.2009.12.007
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)
https://doi.org/10.1016/j.jcta.2003.12.003
Word problem of the Perkins semigroup via directed acyclic graphs
Kitaev Sergey, Seif Steven
Order Vol 25, pp. 177-194 (2008)
https://doi.org/10.1007/s11083-008-9083-7
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)
https://doi.org/10.1007/978-3-642-25870-1_18
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)
https://doi.org/10.4310/JOC.2011.v2.n1.a6

More publications

Back to staff profile

Teaching

  • Combinatorics
  • Graph Theory
  • Discrete Mathematics
  • Computability and Complexity
  • Algorithms
  • Business Analytics
Back to staff profile

Research Interests

  • Combinatorics
  • Graph Theory
  • Discrete Analysis
  • Formal Languages 

Professional Activities

AMS-MAA joint Meetings
Invited speaker
15/1/2010
AMS-MAA joint Meetings
Invited speaker
12/1/2013
International Permutation Patterns Conference
Keynote/plenary speaker
8/7/2014
Member of the Steering Committee of the Permutation Patterns Conference (Event)
Member
2014
Journal of Discrete Mathematics (Journal)
Editor
2012
10th International Conference on Permutation Patterns
Chair
11/6/2012

More professional activities

Projects

Shortening universal words and DNA sequence assembly
Kitaev, Sergey (Principal Investigator)
01-Jan-2023 - 31-Jan-2024

More projects

Back to staff profile

Contact

Professor Sergey Kitaev
Mathematics and Statistics

Email: sergey.kitaev@strath.ac.uk
Tel: 548 3665

Our faculties & departments