๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fine and Wilf's theorem for three periods and a generalization of Sturmian words

โœ Scribed by M.Gabriella Castelli; Filippo Mignosi; Antonio Restivo

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
700 KB
Volume
218
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

โœฆ Synopsis

We extend the theorem of Fine and Wilf to words having three periods. We then define the set 3-PER of words of maximal length for which such result does not apply. We prove that the set 3-PER and the sequences of complexity 2n + 1, introduced by Amoux and Rauzy to generalize Sturmian words, have the same set of factors.

๐Ÿ“œ SIMILAR VOLUMES

Partial words and a theorem of Fine and
Partial words and a theorem of Fine and Wilf
โœ Jean Berstel; Luc Boasson ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 413 KB

A partial word is a word that is a partial mapping into an alphabet. We prove a variant of Fine and Wilf's theorem for partial words, and give extensions of some general combinatorial properties of words.

A short proof for a generalization of Vi
A short proof for a generalization of Vizing's theorem
โœ Claude Berge; Jean Claude Fournier ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 183 KB ๐Ÿ‘ 1 views

## Abstract For a simple graph of maximum degree ฮ”, it is always possible to color the edges with ฮ” + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, ฮ” colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re