English
Related papers

Related papers: Sturmian words, $\beta$-shifts, and transcendence

200 papers

We consider numbers of the form $S_\beta(\boldsymbol{u}):=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$ for $\boldsymbol{u}=\langle u_n \rangle_{n=0}^\infty$ a Sturmian sequence over a binary alphabet and $\beta$ an algebraic number with…

Formal Languages and Automata Theory · Computer Science 2023-08-29 Florian Luca , Joel Ouaknine , James Worrell

The $\beta$-shift is the transformation from the unit interval to itself that maps $x$ to the fractional part of $\beta x$. Permutations realized by the relative order of the elements in the orbits of these maps have been studied for…

Combinatorics · Mathematics 2016-11-18 Sergi Elizalde , Katherine Moore

It is known that for a uniform morphic sequence $\boldsymbol u = \langle u_n\rangle_{n=0}^\infty$ and an algebraic number $\beta$ such that $|\beta|>1$, the number $[\![\boldsymbol{u} ]\!]_\beta:=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$…

Number Theory · Mathematics 2025-05-16 Pavol Kebis , Florian Luca , Joel Ouaknine , Andrew Scoones , James Worrell

Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…

Dynamical Systems · Mathematics 2017-07-31 Florent Nguema Ndong

We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$. We determine with the accuracy of $\pm 1$ the maximal number of…

Discrete Mathematics · Computer Science 2007-05-23 Lubomíra Balková , Edita Pelantová , Ondřej Turek

Let $b$ be an algebraic number with $|b|>1$ and $\mathcal{H}$ a finite set of algebraic numbers. We study the transcendence of numbers of the form $\sum_{n=0}^\infty \frac{a_n}{b^n}$ where $a_n \in \mathcal{H}$ for all $n\in\mathbb{N}$. We…

Number Theory · Mathematics 2022-06-13 Florian Luca , Joël Ouaknine , James Worrell

Given a real number beta>1, a permutation pi of length n is realized by the beta-shift if there is some x in [0,1] such that the relative order of the sequence x,f(x),...,f^{n-1}(x), where f(x) is the factional part of beta*x, is the same…

Combinatorics · Mathematics 2010-08-26 Sergi Elizalde

The beta transformation is the iterated map $\beta x\,\mod1$; it generates the base-$\beta$ expansion of a real number x. Every iterated piece-wise monotonic map is topologically conjugate to the beta transformation. For all but a countable…

Dynamical Systems · Mathematics 2024-02-02 Linas Vepstas

Dendric shift spaces simultaneously generalize codings of regular interval exchanges and episturmian shift spaces, themselves both generalizations of Sturmian words. One of the key properties enforced by dendricity is the Return Theorem. In…

Discrete Mathematics · Computer Science 2025-08-08 France Gheeraert , Herman Goulet-Ouellet , Julien Leroy , Pierre Stas

This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (-\beta)-expansions. We give an admissibility criterion for more general case of…

Discrete Mathematics · Computer Science 2011-08-19 Daniel Dombek

We study the abelian period sets of Sturmian words, which are codings of irrational rotations on a one-dimensional torus. The main result states that the minimum abelian period of a factor of a Sturmian word of angle $\alpha$ with continued…

Formal Languages and Automata Theory · Computer Science 2020-07-27 Jarkko Peltomäki

Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…

Formal Languages and Automata Theory · Computer Science 2023-04-12 Pierre Béaur , Benjamin Hellouin de Menibus

We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form $\alpha\beta\gamma$, where $\alpha,\beta,\gamma$ is any permutation of the symbols…

Formal Languages and Automata Theory · Computer Science 2021-12-23 Gabriele Fici , Jeffrey Shallit

We prove that the Fibonacci word $f$ satisfies among all characteristic Sturmian words, three interesting extremal properties. The first concerns the length and the second the minimal period of its palindromic prefixes. Each of these two…

Discrete Mathematics · Computer Science 2012-09-19 Aldo de Luca

We prove the Pisot Conjecture for beta-substitutions: If beta is a Pisot number, the tiling dynamical system associated with the beta-substitution has pure discrete spectrum. As corollaries: (1) arithmetical coding of the hyperbolic…

Dynamical Systems · Mathematics 2016-09-28 Marcy Barge

In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…

Dynamical Systems · Mathematics 2024-04-03 Marie-Pierre Béal , Dominique Perrin , Antonio Restivo

We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of a unimodal continuous map from the unit interval into itself, but it also characterizes univoque real…

Number Theory · Mathematics 2008-12-02 Jean-Paul Allouche

Given a real number $ \beta > 1$, we study the associated $ (-\beta)$-shift introduced by S. Ito and T. Sadahiro. We compares some aspects of the $(-\beta)$-shift to the $\beta$-shift. When the expansion in base $ -\beta $ of $…

Dynamical Systems · Mathematics 2018-08-20 Florent Nguema Ndong

Paper withdrawn; will be replaced by revised version containing application to lattice models as well. We study hierarchical properties of Sturmian words. These properties are similar to those of substitution dynamical systems. This…

Dynamical Systems · Mathematics 2007-05-23 Daniel Lenz

In this book chapter, written in French, we consider the classical family of Sturmian words, defined as the aperiodic infinite words containing only $n+1$ factors of a length $n$, which is the minimal possible value. We will discuss several…

Combinatorics · Mathematics 2019-05-14 Anna Frid
‹ Prev 1 2 3 10 Next ›