zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Combinatorics on words. Christoffel words and repetitions in words. (English) Zbl 1161.68043
CRM Monograph Series 27. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4480-9/hbk). xii, 147 p. $ 51.00 (2009).

This monograph is based on lectures presented during the school on “Combinatorics on Words”, held in March 2007 at the Centre de recherches mathématiques, Montréal, Canada. The monograph is divided into two independent parts.

The first part gives a self-contained review of results on Christoffel words and their applications. Christoffel words are defined as codes of monotonic paths in discrete plane or equivalently as cycles in Cayley graphs of groups 𝒵/(a+b)𝒵, where a,b are relatively prime.

In the second part, there are presented some recent results on combinatorics on words that deal with repetition in special classes of words. Special attention is paid to properties and applications of Thue-Morse words.


MSC:
68R15Combinatorics on words
05E20Group actions on designs, etc. (MSC2000)
05-02Research monographs (combinatorics)
68-02Research monographs (computer science)