Counting words by number of occurrences of some patterns (Q553997)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting words by number of occurrences of some patterns |
scientific article; zbMATH DE number 5933966
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting words by number of occurrences of some patterns |
scientific article; zbMATH DE number 5933966 |
Statements
Counting words by number of occurrences of some patterns (English)
0 references
29 July 2011
0 references
Summary: We give asymptotic expressions for the number of words containing a given number of occurrences of a pattern for two families of patterns with two parameters each. One is the family of classical patterns in the form \(22 \cdots 212 \cdots 22\) and the other is a family of partially ordered patterns. The asymptotic expressions are in terms of the number of solutions to an equation, and for one subfamily this quantity is the number of integer partitions into \(q\)th order binomial coefficients.
0 references
classical pattern
0 references
occurrence
0 references
asymptotics
0 references
word
0 references
partially ordered pattern
0 references
