Related papers: The Farey Sequence, Stern Brocot Tree and Euclids …
We introduce several classes of pseudorandom sequences which represent a natural extension of classical methods in random number generation. The sequences are obtained from constructions on labeled binary trees, generalizing the well-known…
We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…
A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction.…
Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to…
The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…
We establish the limiting distribution of certain subsets of Farey sequences, i.e., sequences of primitive rational points, on expanding horospheres in covers $\Delta\backslash\mathrm{SL}(n+1,\mathbb{R})$ of…
To the Farey tessellation of the upper half-plane we associate an AF algebra encoding the cutting sequences that define vertical geodesics. The Effros-Shen AF algebras arise as quotients of our algebra. Using the path algebra model for AF…
We construct a countable planar graph which, for any two vertices $u,v$ and any integer $k\ge 1$, contains $k$ edge-disjoint order-compatible $u$--$v$ paths but not infinitely many. This graph has applications in Ramsey theory, in the study…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
A generalization of the Gr\"{u}nwald difference approximation for fractional derivatives in terms of a real sequence and its generating function is presented. Properties of the generating function are derived for consistency and order of…
As the conclusion of a line of investigation undertaken in two previous papers, we compute asymptotic frequencies for the values taken by numerators of differences of consecutive Farey fractions with denominators restricted to lie in…
A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions…
We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…
We study two types of problems for polynomial Farey fractions. For a positive integer $Q$, and polynomial $P(x)\in\mathbb{Z}[X]$ with $P(0)=0$, we define polynomial Farey fractions as \[\mathcal{F}_{Q,P}:=\left\{\frac{a}{q}: 1\leq a\leq…
The spacing distribution between Farey points has drawn attention in recent years. It was found that the gaps $\gamma_{j+1}-\gamma_j$ between consecutive elements of the Farey sequence produce, as $Q\to\infty$, a limiting measure. Numerical…
An increasing sequence $(x_i)_{i=1}^n$ of positive integers is an $n$-term Egyptian underapproximation of $\theta \in (0,1]$ if $\sum_{i=1}^n \frac{1}{x_i} < \theta$. A greedy algorithm constructs an $n$-term underapproximation of $\theta$.…
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 chaotic phenomenon of intermittency is modeled by a simple map of the unit interval, the Farey map. The long term dynamical behaviour of a point under iteration of the map is translated into a spin system via symbolic dynamics. Methods…
We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…
In this paper we study how to accelerate the convergence of the ratios (x_n) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (x_{g_n}) for every linear recurrent sequence…