Counting occurrences of some subword patterns

2002/04/26 by Alexander Burstein, A. Burstein, Burstein, A. +3 · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #math.CO #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.math/0204320

9 pages

openalex publication_date 2002/04/26 · arxiv created 2003/01/30 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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 patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.

Citations

• Generalized Pattern Avoidance

Cited by

• Counting occurrences of a pattern in a binary word

Related

• Enumeration of non-crossing partitions according to subwords with repeated letters
• The sigma-sequence and counting occurrences of some patterns, subsequences and subwords
• Counting the occurrences of generalized patterns in words generated by a morphism
• Enumeration of some classes of words avoiding two generalized patterns of length three
• Subsequence frequency in binary words