13 citations · 18 across the 8 of their papers we have counts for
Showing 2002Show all
3 papers · 1 filter
math.CO2002
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…
math.CO2002
Pattern containment and combinatorial inequalities
Alexander I. Burstein
We use a probabilistic method to produce some combinatorial inequalities by considering pattern containment in permutations and words.
math.CO2002
Counting occurrences of some subword patterns
A. Burstein, T. Mansour
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword pa…