An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n + 1) - p(n)  ≤ 2

Reference : An S-adic characterization of minimal subshifts with first difference of complexity 1...


	Document type :	Scientific journals : Article
	Discipline(s) :	Physical, chemical, mathematical & earth Sciences : Mathematics
	To cite this reference:	http://hdl.handle.net/10993/26291

Title :	An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n + 1) - p(n) ≤ 2
Language :	English
Author, co-author :	Leroy, Julien [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit]
Publication date :	2014
Journal title :	Discrete Mathematics and Theoretical Computer Science
Publisher :	Chapman & Hall
Volume :	16
Issue/season :	1
Pages :	233--286
Peer reviewed :	Yes (verified by ORBi^lu)
ISSN :	1365-8050
City :	London
Country :	United Kingdom
Keywords :	[en] S-adic conjecture ; factor complexity ; special factor ; Rauz y graph
Abstract :	[en] In [Ergodic Theory Dynam. System, 16 (1996) 663–682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is S-adic with Card(S)≤ 3^27. In this paper, we improve this result by giving an S-adic charaterization of these subshifts with a set S of 5 morphisms, solving by this way the S-adic conjecture for this particular case.
Permalink :	http://hdl.handle.net/10993/26291
Other URL :	http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2374

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Limited access	An S-adic characterization of minimal subshifts with first difference of complexity.pdf		Author preprint	890.94 kB	Request a copy

All documents in ORBi^lu are protected by a user license.