Counting words by number of occurrences of some patterns
type: Item
instance of: scholarly article
title: Counting words by number of occurrences of some patterns
zbMATH Open document ID: 1227.05016
author: Andrew MacFie
author: Daniel Panario
author: Zhicheng Gao
published in: The Electronic Journal of Combinatorics
publication date: 2011-07-29T00:00:00Z
full work available at URL: https://eudml.org/doc/233757
full work available at URL: v18i1p143.html
review text: 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.
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5933966
zbMATH Keywords: classical pattern
zbMATH Keywords: occurrence
zbMATH Keywords: asymptotics
zbMATH Keywords: word
zbMATH Keywords: partially ordered pattern
describes a project that uses: OEIS
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5933966