Zobrazeno 1 - 10
of 148
pro vyhledávání: '"Cassaigne, Julien"'
Autor:
Cassaigne, Julien, Kaboré, Idrissa
In this paper, we construct a uniformely recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent infinite wor
Externí odkaz:
http://arxiv.org/abs/2210.02371
Autor:
Cassaigne, Julien, Gheeraert, France, Restivo, Antonio, Romana, Giuseppe, Sciortino, Marinella, Stipulanti, Manon
Publikováno v:
In Journal of Combinatorial Theory, Series A November 2024 208
Publikováno v:
Moscow J. Comb. Number Th. 11 (2022) 287-333
We study ternary sequences associated with a multidimensional continued fraction algorithm introduced by the first author. The algorithm is defined by two matrices and we show that it is measurably isomorphic to the shift on the set $\{1,2\}^\mathbb{
Externí odkaz:
http://arxiv.org/abs/2102.10093
The Arnoux-Rauzy systems are defined in \cite{ar}, both as symbolic systems on three letters and exchanges of six intervals on the circle. In connection with a conjecture of S.P. Novikov, we investigate the dynamical properties of the interval exchan
Externí odkaz:
http://arxiv.org/abs/1906.09408
In this note we classify sequences according to whether they are morphic, pure morphic, uniform morphic, pure uniform morphic, primitive morphic, or pure primitive morphic, and for each possibility we either give an example or prove that no example i
Externí odkaz:
http://arxiv.org/abs/1711.10807
Publikováno v:
In: Brlek S., Dolce F., Reutenauer C., Vandomme \'E. (eds) Combinatorics on Words. WORDS 2017. Lecture Notes in Computer Science, vol 10432. Springer, Cham
We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a particular Multidi
Externí odkaz:
http://arxiv.org/abs/1707.02741
Let $A^*$ denote the free monoid generated by a finite nonempty set $A.$ In this paper we introduce a new measure of complexity of languages $L\subseteq A^*$ defined in terms of the semigroup structure on $A^*.$ For each $L\subseteq A^*,$ we define i
Externí odkaz:
http://arxiv.org/abs/1607.04728
We consider the complexity of integer base expansions of algebraic irrational numbers from a computational point of view. We show that the Hartmanis--Stearns problem can be solved in a satisfactory way for the class of multistack machines. In this di
Externí odkaz:
http://arxiv.org/abs/1601.02771
We study the decidability of three well-known problems related to integer matrix multiplication: Mortality (M), Zero in the Left-Upper Corner (Z), and Zero in the Right-Upper Corner (R). Let d and k be positive integers. Define M(k, d x d) as the fol
Externí odkaz:
http://arxiv.org/abs/1404.0644
We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem to the sett
Externí odkaz:
http://arxiv.org/abs/1402.5843