The n-dimensional Stern-Brocot tree
DOI10.1142/S1793042119500672zbMATH Open1450.11069OpenAlexW1163235289MaRDI QIDQ5223031FDOQ5223031
Authors: Håkan Lennerstad 
Publication date: 4 July 2019
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793042119500672
Recommendations
matrix representationmultidimensional continued fractionStern-Brocot treecoprimality\(\mathrm{SL}(n, \mathbb{N})\)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Continued fractions and generalizations (11J70) Recurrences (11B37) Farey sequences; the sequences (1^k, 2^k, dots) (11B57)
Cites Work
- Title not available (Why is that?)
- Ten Lectures on Wavelets
- Multidimensional Euclidean algorithms, numeration and substitutions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fast algorithm for the two dimensional HJB equation of stochastic control
- Best simultaneous Diophantine approximations. II: Behavior of consecutive best approximations
- Title not available (Why is that?)
- Stern-Brocot trees in cascades of mixed-mode oscillations and canards in the extended Bonhoeffer-van der Pol and the FitzHugh-Nagumo models of excitable systems
- Wavelets and Dilation Equations: A Brief Introduction
- The probability that random positive integers are \(k\)-wise relatively prime
- Computational strategies for the Riemann zeta function
- The probability that \(k\) positive integers are relatively \(r\)-prime
- On the probability that \(k\) positive integers are relatively prime
- Title not available (Why is that?)
- Exact arithmetic on the Stern-Brocot tree
- A multifractal analysis for Stern-Brocot intervals, continued fractions and Diophantine growth rates
- Primes in Fibonacci \(n\)-step and Lucas \(n\)-step sequences
- Title not available (Why is that?)
- Proportionally modular Diophantine inequalities and the Stern-Brocot tree
- Revisiting Digital Straight Segment Recognition
- Parallel Processor Scheduling with Limited Number of Preemptions
- Random Fibonacci sequences and the number $1.13198824\dots$
- How do random Fibonacci sequences grow?
- Almost-sure growth rate of generalized random Fibonacci sequences
- The maximum gain of increasing the number of preemptions in multiprocessor scheduling
- Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
- Title not available (Why is that?)
- Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
- Farey nets and multidimensional continued fractions
- On almost everywhere strong convergence of multi-dimensional continued fraction algorithms
- Musical intervals and special linear transformations
- Title not available (Why is that?)
- Two musical paths to the Farey series and devil's staircase
- Decomposing rational numbers
Cited In (12)
- Asymptotics for two-dimensional Farey-Brocot nets
- Representation and coding of rational pairs on a triangular tree and Diophantine approximation in \(\mathbb R^2\)
- Stern sequences for a family of multidimensional continued fractions: TRIP-Stern sequences
- Brief announcement
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variation of the Stern-Brocot tree
- Algebraic Number Starscapes
- The Ostaszewski square and homogeneous Souslin trees
- Child's addition in the Stern-Brocot tree
- Linking the Calkin-Wilf and Stern-Brocot trees
This page was built for publication: The \(n\)-dimensional Stern-Brocot tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223031)
