Enumeration schemes for words avoiding patterns with repeated letters.

Pudwell, Lara

Displaying similar documents to “Enumeration schemes for words avoiding patterns with repeated letters.”

Counting occurrences of some subword patterns.

Burstein, Alexander, Mansour, Toufik (2003)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Wilf-equivalence on $k$ -ary words, compositions, and parking functions.

Jelínek, Vít, Mansour, Toufik (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Further applications of a power series method for pattern avoidance.

Rampersad, Narad (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Place-difference-value patterns: a generalization of generalized permutation and word patterns.

Kitaev, Sergey, Remmel, Jeffrey (2010)

Integers

Similarity:

Words restricted by patterns with at most 2 distinct letters.

Burstein, Alexander, Mansour, Toufik (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Counting words by number of occurrences of some patterns.

Gao, Zhicheng, MacFie, Andrew, Panario, Daniel (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Enumeration schemes for permutations avoiding barred patterns.

Pudwell, Lara (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Enumerating segmented patterns in compositions and encoding by restricted permutations.

Kitaev, Sergey, McAllister, Tyrrell B., Petersen, T. Kyle (2006)

Integers

Similarity:

$n$ -words over any alphabet with forbidden any 3-subwords.

Doroslovački, Rade, Marković, Olivera (2000)

Novi Sad Journal of Mathematics

Similarity:

A note on antichains of words.

Currie, James D. (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The Möbius function of the consecutive pattern poset.

Bernini, Antonio, Ferrari, Luca, Steingrímsson, Einar (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

$n$ -words over any alphabet without subword $a \underset{k - 1}{\underset{︸}{b \dots b}} a$ for fixed $a$ , $b$ and $k$ .

Doroslovački, Rade, Marković, Olivera (2000)

Novi Sad Journal of Mathematics

Similarity: