Related papers: V Tree -- Continued Fraction Expansion, Stern-Broc…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
In this article, we present a binary tree with vertices given by rational functions $p(x)/q(x)$; the root and functional derivation of children are inspired by continued fractions. We prove some special properties of the tree. For example,…
In this study, we explore a novel approach to demonstrate the countability of rational numbers and illustrate the relationship between the Calkin-Wilf tree and the Stern-Brocot tree in a more intuitive manner. By employing a growth pattern…
A binary word is called $q$-decreasing, for $q>0$, if inside this word each of length-maximal (in the local sense) occurrences of a factor of the form $0^a1^b$, $a>0$, satisfies $q \cdot a > b$. We bijectively link $q$-decreasing words with…
This paper concerns the relationships between continued fractions and the geometry of the Stern-Brocot diagram. Each rational number can be expressed as a continued fraction $[a_0; a_1, \ldots, a_n]$ whose terms $a_i$ are integers and are…
The Minkowski question mark function ?(x) arises as a real distribution of rationals in the Farey tree. We examine the generating function of moments of ?(x). It appears that the generating function is a direct dyadic analogue of period…
We introduce the concept of Minkowski normality, a different type of normality for the regular continued fraction expansion. We use the ordering \[ \frac{1}{2},\quad \frac{1}{3}, \frac{2}{3},\quad \frac{1}{4}, \frac{3}{4},\frac{2}{5},…
The Minkowski Question Mark function relates the continued-fraction representation of the real numbers, to their binary expansion. This function is peculiar in many ways; one is that its derivative is 'singular'. One can show by classical…
The Minkowski question mark function, maping the unit interval to itself, is a continuous, strictly increasing, one-to-one and onto function that has derivative zero almost everywhere. Key to these facts are the basic properties of…
We present the classical Stern-Brocot tree and provide a new proof of the fact that every rational number between 0 and 1 appears in the tree. We then generalize theStern-Brocot tree to allow for arbitrary choice of starting terms, and…
We give an affirmative answer to a question asked by N. Moshchevitin \cite{m1} in his lecture at International Congress of Basic Science, Beijing, 2024 (see also \cite{m}, Section 6.3). The question is that whether the remainder $$…
For the Minkowski question mark function $?(x)$ we consider derivative of the function $f_n(x) = \underbrace{?(?(...?}_\text{n times}(x)))$. Apart from obvious cases (rational numbers for example) it is non-trivial to find explicit examples…
A hyperbinary expansion of a positive integer n is a partition of n into powers of 2 in which each part appears at most twice. In this paper, we consider a generalization of this concept and a certain statistic on the corresponding set of…
We study analogues of Minkowski's question mark function $?(x)$ related to continued fractions with even or odd partial quotients. We prove that these functions are H\"older continuous with precise exponents, and that they linearize the…
We revisit the problem of rational search: given an unknown rational number $\alpha = \frac{a}{b} \in (0,1)$ with $b \leq n$, the goal is to identify $\alpha$ using comparison queries of the form ``$\beta \leq \alpha$?''. The problem has…
There are two well-known ways to enumerate the positive rational numbers in an infinite binary tree: the Farey/Stern-Brocot tree and the Calkin-Wilf tree. In this brief note, we describe these two trees as `transpose shadows' of a tree of…
The Brownian continuum tree was extensively studied in the 90s as a universal random metric space. One construction obtains the continuum tree by a change of metric from an excursion function (or continuous circle mapping) on $[0,1]$. This…
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
We observe that a standard transformation between \emph{ordinal} trees (arbitrary rooted trees with ordered children) and binary trees leads to interesting succinct binary tree representations. There are four symmetric versions of these…