Completing a Combinatorial Proof of the Rigidity of Sturmian Words Generated by Morphisms - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Reports (Research Report) Year : 2010

Completing a Combinatorial Proof of the Rigidity of Sturmian Words Generated by Morphisms

Abstract

In the paper "On the conjugation of standard morphisms, Theoret. Comput. Sci. 195 (1998), 91-109", Séébold announced that Sturmian words generated by morphisms are all rigid. There was a gap in the proof. This gap is corrected here to complete a combinatorial proof of this result.

Domains

Discrete Mathematics [cs.DM] Combinatorics [math.CO]
Fichier principal
Vignette du fichier
Complement_rigid_V_Hal.pdf (124.47 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Patrice Séébold  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00512187

Submitted on : Friday, August 27, 2010-4:54:00 PM

Last modification on : Thursday, April 4, 2024-4:01:36 PM

Long-term archiving on : Tuesday, October 23, 2012-3:15:36 PM

Download

Dates and versions

lirmm-00512187 , version 1 (27-08-2010)

Identifiers

  • HAL Id : lirmm-00512187 , version 1

Cite

Gwenaël Richomme, Patrice Séébold. Completing a Combinatorial Proof of the Rigidity of Sturmian Words Generated by Morphisms. [Research Report] RR-10030, Lirmm. 2010. ⟨lirmm-00512187⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UNIV-MONTP3 LIRMM TDS-MACS LARA MIPS UNIV-MONTPELLIER
344 View
166 Download

Share

More