Counting ordered patterns in words generated by morphisms

Kitaev, Sergey and Mansour, Toufik and Seebold, Patrice (2008) Counting ordered patterns in words generated by morphisms. Integers: Electronic Journal of Combinatorial Number Theory, 8 (1). A-3. ISSN 1553-1732

Full text not available in this repository.Request a copy from the Strathclyde author

Abstract

We start a general study of counting the number of occurrences of ordered patterns in words generated by morphisms. We consider certain patterns with gaps (classical patterns) and those with no gaps (consecutive patterns). Occurrences of the patterns are known, in the literature, as rises, descents, (non-)inversions, squares and p-repetitions. We give recurrence formulas in the general case, then deducing exact formulas for particular families of morphisms. Many (classical or new) examples are given illustrating the techniques and showing their interest.

Creators(s):	Kitaev, Sergey ORCID: https://orcid.org/0000-0003-3324-1647, Mansour, Toufik and Seebold, Patrice;
Item type:	Article
ID code:	49837
Keywords:	classical patterns, ordered patterns, morphisms, Electronic computers. Computer science
Subjects:	Science > Mathematics > Electronic computers. Computer science
Department:	Faculty of Science > Computer and Information Sciences
Depositing user:	Pure Administrator
Date deposited:	15 Oct 2014 14:06
Last modified:	01 Jan 2021 11:04
Related URLs:	Related item Journal or Publication
URI:	https://strathprints.strath.ac.uk/id/eprint/49837
Export data:

CORE (COnnecting REpositories)