S. Kitaev

activity

20022009

most citedSimultaneous avoidance of generalized patterns

15 citations · 72 across the 18 of their papers we have counts for

collaborators

Showing 2008Show all

3 papers · 1 filter

math.CO2008★ 1 cited

On representable graphs, semi-transitive orientations, and the representation numbers

Magnus Mar Halldorsson, Sergey Kitaev, Artem Pyatkin

A graph $G = (V, E)$ is representable if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x, y) \in E$ for each $x \neq = y$ . I…

math.CO2008

Rationality, irrationality, and Wilf equivalence in generalized factor order

Sergey Kitaev, Jeffrey Liese, Jeffrey Remmel +1

Let $P$ be a partially ordered set and consider the free monoid $P^{*}$ of all words over $P$ . If $w, w^{'} \in P^{*}$ then $w^{'}$ is a factor of $w$ if there are words $u, v$ with $w = u w^{'} v$ . D…

math.CO2008★ 4 cited

Classification of bijections between 321- and 132-avoiding permutations

Anders Claesson, Sergey Kitaev

It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permutations is equal to that of 132-avoiding permutations. In the literature one can…