Counting occurrences of some subword patterns

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages

Keywords

Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/63919

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0204320
 http://arxiv.org/abs/math/0204320

Collections

arXiv