Related papers: The Farey Sequence, Stern Brocot Tree and Euclids …
Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$. We consider…
There are several standard procedures used to create new sequences from a given sequence or from a given pair of sequences. In this paper I discuss the most popular of these procedures. For each procedure, I give a definition and provide…
In this paper we obtain multifractal generalizations of classical results by L\'evy and Khintchin in metrical Diophantine approximations and measure theory of continued fractions. We give a complete multifractal analysis for Stern--Brocot…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
We embed multidimensional Farey fractions in large horospheres and explain under which conditions they become uniformly distributed in the ambient homogeneous space. This question has recently been investigated in the case of SL(d,Z) to…
We present algorithms for computing ranks and order statistics in the Farey sequence, taking time O (n^{2/3}). This improves on the recent algorithms of Pawlewicz [European Symp. Alg. 2007], running in time O (n^{3/4}). We also initiate the…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to…
A new algebraic object is introduced - recurrent fractions, which is an n-dimensional generalization of continued fractions. It is used to describe an algorithm for rational approximations of algebraic irrational numbers. Some…
Our main theorem identifies a class of totally geodesic subgraphs of the 1-skeleton of the pants complex, each isomorphic to the product of two Farey graphs. We deduce the existence of many convex planes in the 1-skeleton of the pants…
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…
In this article, we considered a fractal image as a fractal curve, that is, as a walk on a grid in Euclidean space $\R^d$. We placed integers on the generating vectors of a grid, such that opposite directions have opposite numbers. This…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
We discuss continued fractions on real quadratic number fields of class number 1. If the field has the property of being 2-stage euclidean, a generalization of the euclidean algorithm can be used to compute these continued fractions.…
The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…
Adolf Hurwitz proposed in 1887 a continued fraction algorithm for complex numbers: Hurwitz continued fractions (HCF). Among other similarities between HCF and regular continued fractions, quadratic irrational numbers over $\mathbb{Q}(i)$…
The task of comparing the Hausdorff spectrum, the computational spectrum, and the Legendre spectrum of a fractal set endowed with a probability measure, was tackled by several authors - Cawley and Mauldin, Riedi and Mandelbrot, among…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
Fractional supersymmetry denotes a generalisation of supersymmetry which may be constructed using a single real generalised Grassmann variable, $\theta = \bar{\theta}, \, \theta^n = 0$, for arbitrary integer $n = 2, 3, ...$. An explicit…