Zobrazeno 1 - 10
of 9 705
pro vyhledávání: '"Rauzy, A"'
In a paper of 1976, Rauzy studied two complexity notions, $\underline{\beta}$ and $\overline{\beta}$, for infinite sequences over a finite alphabet. The function $\underline{\beta}$ is maximum exactly in the Borel normal sequences and $\overline{\bet
Externí odkaz:
http://arxiv.org/abs/2406.18383
We consider numbers of the form $S_\beta(\boldsymbol{u}):=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$, where $\boldsymbol{u}=\langle u_n \rangle_{n=0}^\infty$ is an infinite word over a finite alphabet and $\beta\in \mathbb{C}$ satisfies $|\beta|>1$. Our
Externí odkaz:
http://arxiv.org/abs/2405.05279
To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in the sense o
Externí odkaz:
http://arxiv.org/abs/2402.15877
We develop a theory of Rauzy fractals for random substitutions, which are a generalisation of deterministic substitutions where the substituted image of a letter is determined by a Markov process. We show that a Rauzy fractal can be associated with a
Externí odkaz:
http://arxiv.org/abs/2401.06732
Autor:
Jurga, Natalia
The Rauzy gasket is the attractor of a parabolic, nonconformal iterated function system on the projective plane which describes an exceptional parameter set in various important topological and dynamical problems. Since 2009 there have been several a
Externí odkaz:
http://arxiv.org/abs/2312.04999
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The Rauzy fractal is a domain in the two-dimensional plane constructed by the Rauzy substitution, a substitution rule on three letters. The Rauzy fractal has a fractal-like boundary, and the currently known its constructions is not only for its bound
Externí odkaz:
http://arxiv.org/abs/2308.10213
Autor:
Ferenczi, Sébastien, Zamboni, Luca Q.
We characterize the clustering of a word under the Burrows-Wheeler transform in terms of the resolution of a bounded number of bispecial factors belonging to the language generated by all its powers. We use this criterion to compute, in every given A
Externí odkaz:
http://arxiv.org/abs/2305.18986
Autor:
M, Rajavel Praveen, R, Rama
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,v_2)$ is formed if the concatenation of the word $v_1$ and the suffix of $v_2$ of length $k-\ell$ is a subword of the infinite word. In this paper, we
Externí odkaz:
http://arxiv.org/abs/2210.08629
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.