Towards a statement of the S-adic conjecture through examples
Fabien Durand (LAMFA), Julien Leroy (LAMFA), Gw\'ena\"el Richomme, (LIRMM)

TL;DR
This paper explores the S-adic conjecture by analyzing the factor complexity of S-adic sequences, providing examples that illustrate properties and challenge potential conditions for sub-linear complexity.
Contribution
It offers an overview of factor complexity in S-adic sequences and presents examples that test and refine the conjecture's proposed conditions.
Findings
Examples illustrating properties of S-adic sequences
Counter-examples to potential conditions for sub-linear complexity
Insights into the structure of S-adic sequences
Abstract
The -adic conjecture claims that there exists a condition such that a sequence has a sub-linear complexity if and only if it is an -adic sequence satisfying Condition for some finite set of morphisms. We present an overview of the factor complexity of -adic sequences and we give some examples that either illustrate some interesting properties or that are counter-examples to what could be believed to be "a good Condition ".
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Mathematical Dynamics and Fractals · Computability, Logic, AI Algorithms
