Sergey Kitaev

Sergey Kitaev Sergey Kitaev (Russian: Сергей Владимирович Китаев; born 1 January 1975 in Ulan-Ude) is a Professor of Mathematics at the University of Strathclyde, Glasgow, Scotland. 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. Provided by Wikipedia
Showing 1 - 9 results of 9 for search 'Sergey Kitaev', query time: 0.02s Refine Results
  1. 1
    Classification of bijections between 321- and 132-avoiding permutations

    Classification of bijections between 321- and 132-avoiding permutations by Anders Claesson, Sergey Kitaev

    Published 2008-01-01
    Get full text
    Article
  2. 2
    On semi-transitive orientability of triangle-free graphs

    On semi-transitive orientability of triangle-free graphs by Sergey Kitaev, Artem V. Pyatkin

    Published 2023-01-01
    Get full text
    Article
  3. 3
    Counting descents, rises, and levels, with prescribed first element, in words

    Counting descents, rises, and levels, with prescribed first element, in words by Sergey Kitaev, Toufik Mansour, Jeff Remmel

    Published 2008-01-01
    Get full text
    Article
  4. 4
    Number of cycles in the graph of $312$-avoiding permutations

    Number of cycles in the graph of $312$-avoiding permutations by Richard Ehrenborg, Sergey Kitaev, Einar Steingrımsson

    Published 2014-01-01
    Get full text
    Article
  5. 5
    Crucial abelian k-power-free words

    Crucial abelian k-power-free words by Amy Glen, Bjarni V. Halldorsson, Sergey Kitaev

    Published 2010-01-01
    Get full text
    Article
  6. 6
    Rationality, irrationality, and Wilf equivalence in generalized factor order

    Rationality, irrationality, and Wilf equivalence in generalized factor order by Sergey Kitaev, Jeffrey Liese, Jeffrey Remmel, Bruce Sagan

    Published 2009-01-01
    Get full text
    Article
  7. 7
    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

    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 by Herman Z. Q. Chen, Sergey Kitaev, Brian Y. Sun

    Published 2020-05-01
    Get full text
    Article
  8. 8
    Unlabeled $(2+2)$-free posets, ascent sequences and pattern avoiding permutations

    Unlabeled $(2+2)$-free posets, ascent sequences and pattern avoiding permutations by Mireille Bousquet-Mélou, Anders Claesson, Mark Dukes, Sergey Kitaev

    Published 2009-01-01
    Get full text
    Article
  9. 9
    On universal partial words

    On universal partial words by Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Y. Sun

    Published 2017-05-01
    Get full text
    Article

Search Tools: