The n-dimensional Stern–Brocot tree
From MaRDI portal
Publication:5223031
DOI10.1142/S1793042119500672zbMath1450.11069OpenAlexW1163235289MaRDI QIDQ5223031
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
matrix representationmultidimensional continued fractionStern-Brocot treecoprimality\(\mathrm{SL}(n, \mathbb{N})\)
Recurrences (11B37) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Continued fractions and generalizations (11J70) Farey sequences; the sequences (1^k, 2^k, dots) (11B57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
- How do random Fibonacci sequences grow?
- Almost-sure growth rate of generalized random Fibonacci sequences
- Best simultaneous Diophantine approximations. II: Behavior of consecutive best approximations
- Farey nets and multidimensional continued fractions
- The probability that \(k\) positive integers are relatively \(r\)-prime
- Computational strategies for the Riemann zeta function
- The maximum gain of increasing the number of preemptions in multiprocessor scheduling
- Exact arithmetic on the Stern-Brocot tree
- On the probability that \(k\) positive integers are relatively prime
- THE PROBABILITY THAT RANDOM POSITIVE INTEGERS ARE k-WISE RELATIVELY PRIME
- Proportionally modular diophantine inequalities and the Stern-Brocot tree
- Decomposing rational numbers
- A multifractal analysis for Stern-Brocot intervals, continued fractions and Diophantine growth rates
- Musical intervals and special linear transformations
- Two musical paths to the Farey series and devil's staircase
- Ten Lectures on Wavelets
- Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
- Parallel Processor Scheduling with Limited Number of Preemptions
- Wavelets and Dilation Equations: A Brief Introduction
- On almost everywhere strong convergence of multi-dimensional continued fraction algorithms
- Random Fibonacci sequences and the number $1.13198824\dots$
- A fast algorithm for the two dimensional HJB equation of stochastic control
- Revisiting Digital Straight Segment Recognition
This page was built for publication: The n-dimensional Stern–Brocot tree
