相关论文: On a tree of rational functions related to continu…

Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…

This paper proves that two differently defined rooted binary trees are isomorphic. The first tree is one associated to a version of Farey sequences where the vertices correspond to the open intervals formed by two successive terms in the…

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…

We introduce a notion of $q$-deformed rational numbers and $q$-deformed continued fractions. A $q$-deformed rational is encoded by a triangulation of a polygon and can be computed recursively. The recursive formula is analogous to the…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

The Stern-Brocot tree and Minkowki's question mark function $?(x)$ (or Conway's box function) are related to the continued fraction expansion of numbers from Q with unary encoding of the partial denominators. We first define binary…

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…

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…

Rationals are known to form interesting and computationally rich structures, such as Farey sequences and infinite trees. Little attention is being paid to more general, systematic exposition of the basic properties of fractions as a set.…

There is a unique path from the root of a tree to any other vertex. Every vertex, except the root, has a parent: the adjoining vertex on this unique path. This is the conventional definition of the parent vertex. For complete binary trees,…

The solution of some equations involving functional derivatives is given as a series indexed by planar binary trees. The terms of the series are given by an explicit recursive formula. Some algebraic properties of these series are…

For $q$ a prime power and $\phi$ a rational function with coefficients in $\mathbb{F}_q$, let $p(q,\phi)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_q)$ that is periodic with respect to $\phi$. And if $d$ is a positive integer, let $Q_d$…

We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…

We introduce a $q$-analog of the higher continued fractions introduced by the last three authors in a previous work (together with Gregg Musiker), which are simultaneously a generalization of the $q$-rational numbers of Morier-Genoud and…

We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…

The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers. For every…

Let $n,p,k$ be three positive integers. We prove that the rational fractions of $q$: $${n \brack k}_{q} {}_3\phi_{2} [ . {matrix}q^{1-k},q^{-p},q^{p-n} q,q^{1-n} {matrix}| q;q^{k+1}]\quad\textrm{and}\quad q^{(n-p)p}\qbi{n}{k}{q} {}_3\phi_2[…

In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

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…