Sergey Kitaev
From Wikipedia, the free encyclopedia
University of Strathclyde
Sergey Kitaev | |
|---|---|
 | |
| Born | 1 January 1975 Ulan-Ude, Russia |
| Alma mater | Novosibirsk State University University of Gothenburg |
| Scientific career | |
| Fields | Mathematics |
| Institutions | Reykjavík University University of Strathclyde |
| Thesis | Generalized patterns in words and permutations (2003) |
| Doctoral advisor | Einar Steingrímsson |
| Website | personal |
Sergey Kitaev (Russian: Сергей Владимирович Китаев; born 1 January 1975 in Ulan-Ude) is a Professor of Mathematics at the University of Strathclyde, Glasgow, Scotland.[1][2][3] He obtained his Ph.D. in mathematics from the University of Gothenburg in 2003 under the supervision of Einar Steingrímsson.[4] Kitaev's research interests concern aspects of combinatorics and graph theory.
Kitaev is best known for his book Patterns in permutations and words (2011), an introduction to the field of permutation patterns.[5] He is also the author (with Vadim Lozin) of Words and graphs (2015) on the theory of word-representable graphs which he pioneered.
Kitaev has written over 120 research articles in mathematics.[6][7] Of particular note is his work generalizing vincular patterns to having partially ordered entries, a classification (with Anders Claesson) of bijections between 321- and 132-avoiding permutations, and a solution (with Steve Seif) of the word problem for the Perkins semigroup, as well as his work on word-representable graphs.[8]
