arXiv subjects
Publications and source records attributed to Wolfgang Steiner.
We show the ergodicity of Tanaka-Ito type $α$-continued fraction maps and construct their natural extensions. We also discuss the relation between entropy and the size of the natural extension domain.
The set of unique $β$-expansions over the alphabet $\{0,1\}$ is trivial for $β$ below the golden ratio and uncountable above the Komornik-Loreti constant. Generalisations of these thresholds for three-letter alphabets were studied by Komornik, Lai and Pedicini (2011, 2017). We use S-adic words including the Thue-Morse word (which defines the Komornik-Loreti constant) and Sturmian words (which characterise generalised golden ratios) to determine the value of a certain generalisation of the Komornik-Loreti constant to three-letter alphabets.
A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing all permutations of length $n$ as factors. It is well known that universal cycles for permutations of length $n$ exist. However, all known ways to construct such cycles are rather complicated. For example, in the original paper establishing the existence of the universal cycles, constructing such a cycle involves finding an Eulerian cycle in a certain graph and then dealing with partially ordered sets. In this paper, we offer a simple way to generate a universal cycle for permutations of length $n$, which is based on applying a greedy algorithm to a permutation of length $n-1$. We prove that this approach gives a unique universal cycle $Π_n$ for permutations, and we study properties of $Π_n$.
We prove that five ways to define entry A086377 in the On-Line Encyclopedia of Integer Sequences do lead to the same integer sequence.
We determine the structure of the set of intermediate $β$-shifts of finite type. Specifically, we show that this set is dense in the parameter space $Δ= \{ (β, α) \in \mathbb{R}^{2} \colon β\in (1, 2) \; \text{and} \; 0 \leq α\leq 2 - β\}$. This generalises the classical result of Parry from 1960 for greedy and (normalised) lazy $β$-shifts.
Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove similar results for negative bases beta.
The finiteness property is an important arithmetical property of beta-expansions. We exhibit classes of Pisot numbers $β$ having the negative finiteness property, that is the set of finite $(-β)$-expansions is equal to $\mathbb{Z}[β^{-1}]$. For a class of numbers including the Tribonacci number, we compute the maximal length of the fractional parts arising in the addition and subtraction of $(-β)$-integers. We also give conditions excluding the negative finiteness property.
Given a finite set of real numbers $A$, the generalised golden ratio is the unique real number $\mathcal{G}(A) > 1$ for which we only have trivial unique expansions in smaller bases, and have non-trivial unique expansions in larger bases. We show that $\mathcal{G}(A)$ varies continuously with the alphabet $A$ (of fixed size). What is more, we demonstrate that as we vary a single parameter $m$ within~$A$, the generalised golden ratio function may behave like $m^{1/h}$ for any positive integer $h$. These results follow from a detailed study of $\mathcal{G}(A)$ for ternary alphabets, building upon the work of Komornik, Lai, and Pedicini (2011). We give a new proof of their main result, that is we explicitly calculate the function $\mathcal{G}(\{0,1,m\})$. (For a ternary alphabet, it may be assumed without loss of generality that $A = \{0,1,m\}$ with $m\in(1,2)]$.) We also study the set of $m \in (1,2]$ for which $\mathcal{G}(\{0,1,m\})=1+\sqrt{m},$ we prove that this set is uncountable and has Hausdorff dimension~$0$. We show that the function mapping $m$ to $\mathcal{G}(\{0,1,m\})$ is of bounded variation yet has unbounded derivative. Finally, we show that it is possible to have unique expansions as well as points with precisely two expansions at the generalised golden ratio.
The aim of this paper is to study the connection between different properties related to $β$-expansions. In particular, the relation between two conditions, both ensuring pure discrete spectrum of the odometer, is analysed. The first one is the so-called Hypothesis B for the $G$-odometers and the second one is denoted by (QM) and it has been introduced in the framework of tilings associated to Pisot $β$-numerations.
We prove an extension of the well-known Pisot substitution conjecture to the $S$-adic symbolic setting on two letters. The proof relies on the use of Rauzy fractals and on the fact that strong coincidences hold in this framework.
We study rational numbers with purely periodic Rényi $β$-expansions. For bases $β$ satisfying $β^2=aβ+b$ with $b$ dividing $a$, we give a necessary and sufficient condition for $γ(β)=1$, i.e., that all rational numbers $p/q\in[0,1)$ with $\gcd(q,b)=1$ have a purely periodic $β$-expansion. A simple algorithm for determining the value of $γ(β)$ for all quadratic Pisot numbers $β$ is described.
For a function from the unit interval to itself with constant slope and one discontinuity, the itineraries of the point of discontinuity are called the critical itineraries. These critical itineraries play a significant role in the study of $β$-expansions (with positive or negative $β$) and fractal transformations. A combinatorial characterization of the critical itineraries of such functions is provided.
For a (non-unit) Pisot number $β$, several collections of tiles are associated with $β$-numeration. This includes an aperiodic and a periodic one made of Rauzy fractals, a periodic one induced by the natural extension of the $β$-transformation and a Euclidean one made of integral beta-tiles. We show that all these collections (except possibly the periodic translation of the central tile) are tilings if one of them is a tiling or, equivalently, the weak finiteness property (W) holds. We also obtain new results on rational numbers with purely periodic $β$-expansions; in particular, we calculate $γ(β)$ for all quadratic $β$ with $β^2 = a β+ b$, $\gcd(a,b) = 1$.
An integral self-affine tile is the solution of a set equation $\mathbf{A} \mathcal{T} = \bigcup_{d \in \mathcal{D}} (\mathcal{T} + d)$, where $\mathbf{A}$ is an $n \times n$ integer matrix and $\mathcal{D}$ is a finite subset of $\mathbb{Z}^n$. In the recent decades, these objects and the induced tilings have been studied systematically. We extend this theory to matrices $\mathbf{A} \in \mathbb{Q}^{n \times n}$. We define rational self-affine tiles as compact subsets of the open subring $\mathbb{R}^n\times \prod_\mathfrak{p} K_\mathfrak{p}$ of the adéle ring $\mathbb{A}_K$, where the factors of the (finite) product are certain $\mathfrak{p}$-adic completions of a number field $K$ that is defined in terms of the characteristic polynomial of $\mathbf{A}$. Employing methods from classical algebraic number theory, Fourier analysis in number fields, and results on zero sets of transfer operators, we establish a general tiling theorem for these tiles. We also associate a second kind of tiles with a rational matrix. These tiles are defined as the intersection of a (translation of a) rational self-affine tile with $\mathbb{R}^n \times \prod_\mathfrak{p} \{0\} \simeq \mathbb{R}^n$. Although these intersection tiles have a complicated structure and are no longer self-affine, we are able to prove a tiling theorem for these tiles as well. For particular choices of digit sets, intersection tiles are instances of tiles defined in terms of shift radix systems and canonical number systems. Therefore, we gain new results for tilings associated with numeration systems.
We study balancedness properties of words given by the Arnoux-Rauzy and Brun multi-dimensional continued fraction algorithms. We show that almost all Brun words on 3 letters and Arnoux-Rauzy words over arbitrary alphabets are finitely balanced; in particular, boundedness of the strong partial quotients implies balancedness. On the other hand, we provide examples of unbalanced Brun words on 3 letters.
The paper deals with balances and imbalances in Arnoux-Rauzy words. We provide sufficient conditions for $C$-balancedness, but our results indicate that even a characterization of 2-balanced Arnoux-Rauzy words on a 3-letter alphabet is not immediate.
We construct a natural extension for each of Nakada's $α$-continued fractions and show the continuity as a function of $α$ of both the entropy and the measure of the natural extension domain with respect to the density function $(1+xy)^{-2}$. In particular, we show that, for all $0 < α\le 1$, the product of the entropy with the measure of the domain equals $π^2/6$. As a key step, we give the explicit relationship between the $α$-expansion of $α-1$ and of $α$.
We show that, for any fixed $\varepsilon > 0$ and almost all primes $p$, the $g$-ary expansion of any fraction $m/p$ with $\gcd(m,p) = 1$ contains almost all $g$-ary strings of length $k < (5/24 - \varepsilon) \log_g p$. This complements a result of J. Bourgain, S. V. Konyagin, and I. E. Shparlinski that asserts that, for almost all primes, all $g$-ary strings of length $k < (41/504 -\varepsilon) \log_g p$ occur in the $g$-ary expansion of $m/p$.