15 citations · 62 across the 16 of their papers we have counts for
7 papers · 1 filter
The Peano curve and counting occurrences of some patterns
S. Kitaev, T. Mansour
We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We then find the number of occurrences of certain patterns in the…
Counting the occurrences of generalized patterns in words generated by a morphism
S. Kitaev, T. Mansour
We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with c…
Partially Ordered generalized patterns and k-ary words
S. Kitaev, T. Mansour
Recently, Kitaev [Ki2] introduced partially ordered generalized patterns (POGPs) in the symmetric group, which further generalize the generalized permutation patterns introduced by…
On multi-avoidance of generalized patterns
T. Mansour, S. Kitaev
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In thre…
Crucial Words and the Complexity of Some Extremal Problems for Sets of Prohibited Words
A. Evdokimov, S. Kitaev
We introduced the notation of a set of prohibitions and give definitions of a complete set and a crucial word with respect to a given set of prohibitions. We consider 3 particular…
There are no iterated morphisms that define the Arshon sequence and the -sequence
Sergey Kitaev
Berstel proved that the Arshon sequence cannot be obtained by iteration of a morphism. An alternative proof of this fact is given here. The -sequence was constructed by Evdokimo…