24 citations · 93 across the 24 of their papers we have counts for
19 papers · 1 filter
Packing patterns into words
A. Burstein, Peter Hästö, T. Mansour
In this article we generalize packing density problems from permutations to patterns with repeated letters and generalized patterns. We are able to find the packing density for som…
Counting occurrences of 132 in an even permutation
T. Mansour
We study the generating function for the number of even (or odd) permutations on n letters containing exactly $r\gs0$ occurrences of 132. It is shown that finding this function for…
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…
Restricted 132-alternating permutations and Chebyshev polynomials
T. Mansour
A permutation is said to be \emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alt…
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…