Related papers: Sturmian words, $\beta$-shifts, and transcendence
Jumping automata are finite automata that read their input in a non-consecutive manner, disregarding the order of the letters in the word. We introduce and study jumping automata over infinite words. Unlike the setting of finite words,…
In this paper we use the framework of algebraic effects from programming language theory to analyze the Beta-Bernoulli process, a standard building block in Bayesian models. Our analysis reveals the importance of abstract data types, and…
A word is called $\beta$-free if it has no factors of exponent greater than or equal to $\beta$. The repetition threshold $\mathrm{RT}(k)$ is the infimum of the set of all $\beta$ such that there are arbitrarily long $k$-ary $\beta$-free…
For any $\lambda>2$, we construct a substitution on an infinite alphabet which gives rise to a substitution tiling with inflation factor $\lambda$. In particular, we obtain the first class of examples of substitutive systems with…
We study the typical growth rate of the number of words of length n which can be extended to beta-expansions of x. In the general case we give a lower bound for the growth rate, while in the case that the Bernoulli convolution associated to…
An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet word. Such a word is thus a natural generalization of a sturmian word to a word over 3-letter alphabet. A…
A Sturmian word is a map W from the natural numbers into {0,1} for which the set of {0,1}-vectors F_n(W):={(W(i),W(i+1),...,W(i+n-1))^T : i \ge 0} has cardinality exactly n+1 for each positive integer n. Our main result is that the volume…
We consider the distribution of the orbits of the number 1 under the $\beta$-transformations $T_\beta$ as $\beta$ varies. Mainly, the size of the set of $\beta>1$ for which a given point can be well approximated by the orbit of 1 is…
We prove a concentration inequality for sequential dynamical systems of the unit interval enjoying an exponential loss of memory in the BV norm, and we investigate several of its consequences. In particular, this covers compositions of…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…
Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for $G$-shifts, where $G$ is a finitely generated group with decidable word problem. A $G$-shift has strong…
A transfer is a group homomorphism from a finite group to an abelian quotient group of a subgroup of the group. In this paper, we explain some of the properties of transfers by using noncommutative determinants. These properties enable us…
In this paper we study the set of digit frequencies that are realised by elements of the set of $\beta$-expansions. The main result of this paper demonstrates that as $\beta$ approaches $1,$ the set of digit frequencies that occur amongst…
Let $\beta>1$. For $x \in [0,\infty)$, we have so-called the $\beta$-expansion of $x$ in base $\beta$ as follows: $$x= \sum_{j \leq k} x_{j}\beta^{j} = x_{k}\beta^{k}+ \cdots + x_{1}\beta+x_{0}+x_{-1}\beta^{-1} + x_{-2}\beta^{-2} + \cdots$$…
Power spectrum of the distributed chaos can be represented by a weighted superposition of the exponential functions which is converged to a stretched exponential $\propto \exp-(k/k_{\beta})^{\beta }$. An asymptotic theory has been developed…
In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…
This paper investigates the $\beta$-symmetry of the heterotic string theory at order $\alpha'$ in the context of open spacetime manifolds. Our analysis reveals that the parity-odd component of the effective action at this order remains…
Usually the 'hidden variables' of Bell's theorem are supposed to describe the pair of Bell particles. Here a semantic shift is proposed, namely to attach the hidden variables to a stochastic medium or field in which the particles move. It…
We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number $n$ better reflect the structure of the associated Sturmian…