Recounting the Rationals
From MaRDI portal
Publication:2757471
DOI10.2307/2589182zbMath0983.11009OpenAlexW4238490854WikidataQ59487322 ScholiaQ59487322MaRDI QIDQ2757471
Neil J. Calkin, Herbert S. Wilf
Publication date: 26 November 2001
Full work available at URL: https://doi.org/10.2307/2589182
Related Items (60)
A calculational approach to path-based properties of the Eisenstein-Stern and Stern-Brocot trees via matrix algebra ⋮ Forests of complex numbers ⋮ On \(\alpha \)-greedy expansions of numbers ⋮ Stern polynomials ⋮ Stern-Brocot tree and Ducci map ⋮ Stern-Brocot sequences from weighted mediants ⋮ The Stern Diatomic Sequence via Generalized Chebyshev Polynomials ⋮ Linear extension numbers of \(n\)-element posets ⋮ Counting Binomial Coefficients Divisible by a Prime Power ⋮ On the approximation by single hidden layer feedforward neural networks with fixed weights ⋮ q-Stern Polynomials as Numerators of Continued Fractions ⋮ Periodic Lorentz gas with small scatterers ⋮ A Tale of Two by Two Matrices ⋮ Statistical distribution of the Stern sequence ⋮ Construction and composition of rooted trees via descent functions ⋮ Unnamed Item ⋮ Euclidean strings ⋮ Cluster duality between Calkin-Wilf tree and Stern-Brocot tree ⋮ On Euclid's algorithm and elementary number theory ⋮ The \(q\)-Calkin-Wilf tree ⋮ Recounting the Rationals: Twice! ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Single Hidden Layer Feedforward Network with Only One Neuron in the Hidden Layer Can Approximate Any Univariate Function ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mean Row Values in (u, v)-Calkin–Wilf Trees ⋮ Left–right pairs and complex forests of infinite rooted binary trees ⋮ Euclid, Calkin \& Wilf --- playing with rationals ⋮ Continued fractions and Stern polynomials ⋮ Reversing the paths in the Ducci tree ⋮ Binary signed-digit integers and the Stern diatomic sequence ⋮ Arithmetic properties of coefficients of power series expansion of \(\prod _{n=0}^{\infty }\left( 1-x^{2^{n}}\right) ^{t}\) (with an appendix by Andrzej Schinzel) ⋮ Free monoids and forests of rational numbers ⋮ A Matrix Related to Stern Polynomials and the Prouhet-Thue-Morse Sequence ⋮ Locating terms in the Stern-Brocot tree ⋮ The Minkowski question mark function: explicit series for the dyadic period function and moments ⋮ Diophantine aspects of the Calkin-Wilf iteration ⋮ Linking the Calkin-Wilf and Stern-Brocot trees ⋮ Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence ⋮ Orphans in forests of linear fractional transformations ⋮ Two trees enumerating the positive rationals ⋮ Substitution invariant Sturmian words and binary trees ⋮ On counting the rational numbers ⋮ An asymptotic formula for the moments of the Minkowski question mark function in the interval \([0,1\)] ⋮ Division safe calculation in totalised fields ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Bird Tree ⋮ On a graph connecting hyperbinary expansions ⋮ The Calkin–Wilf Tree of a Quadratic Surd ⋮ THE MOMENTS OF MINKOWSKI QUESTION MARK FUNCTION: THE DYADIC PERIOD FUNCTION ⋮ An alternative approach to generalized Pythagorean scales. Generation and properties derived in the frequency domain ⋮ Listing the Positive Rationals ⋮ Unnamed Item ⋮ A forest of linear fractional transformations ⋮ Smooth approximations by continuous choice-functions ⋮ A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE ⋮ Hyperbinary expansions and Stern polynomials ⋮ Sturmian words and the Stern sequence
This page was built for publication: Recounting the Rationals
