Counting occurrences of some subword patterns

Simple item page
dc.creatorBurstein, A.
dc.creatorMansour, T.
dc.date2002-04-26
dc.date2003-01-30
dc.date.accessioned2026-07-07T04:48:06Z
dc.date.available2026-07-07T04:48:06Z
dc.descriptionWe 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0204320
dc.identifierhttp://arxiv.org/abs/math/0204320
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/63919
dc.subjectCombinatorics
dc.titleCounting occurrences of some subword patterns
dc.typetext

Files

Collections

arXiv