Sergey Kitaev Explained

Sergey Kitaev
Birth Date:1975 1, df=yes
Birth Place:Ulan-Ude, Russia
Nationality:Russian, British
Field:Mathematics
Doctoral Advisor:Einar Steingrímsson
Thesis Title:Generalized patterns in words and permutations
Thesis Year:2003

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.Kitaev's research interests concern aspects of combinatorics and graph theory.

Contributions

Kitaev is best known for his book Patterns in permutations and words (2011), an introduction to the field of permutation patterns.[4] 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.[5] [6] 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.[7]

Selected publications

External links

Notes and References

  1. https://www.strath.ac.uk/staff/?department=Mathematics%20and%20Statistics Staff | University of Strathclyde
  2. https://www.strath.ac.uk/staff/kitaevsergeydr Professor Sergey Kitaev | University of Strathclyde
  3. http://combinatorics.cis.strath.ac.uk The Strathclyde Combinatorics Group
  4. Book: Vatter. Vincent. 2015. Permutation classes. Bóna . Miklós. The Handbook of Enumerative Combinatorics. CRC Press.
  5. https://mathscinet.ams.org/mathscinet/author?authorId=706993 Sergey Kitaev | MathsciNet Mathematical Reviews
  6. https://orcid.org/0000-0003-3324-1647 Sergey Kitaev | ORCID
  7. Steingrímsson . Einar . The history of the Gothenburg–Reykjavík–Strathclyde Combinatorics Group . Enumerative Combinatorics and Applications . 2023 . 3 . 1 . 10.54550/ECA2023V3S1H1.