Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An $S$-adic characterization of minimal subshifts with first difference of complexity $1 \leq p(n+1) - p(n) \leq 2$ (1305.0434v1)

Published 2 May 2013 in cs.DM and math.CO

Abstract: 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 \leq 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.

Citations (4)

Summary

We haven't generated a summary for this paper yet.