# Stern–Brocot tree

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- 2017

We discover a bijective map between the Gauss Map and the left-half of the Stern-Brocot Tree. The domain of the Gauss Map is then… (More)

Is this relevant?

2015

2015

- Archive of Formal Proofs
- 2015

The Stern-Brocot tree contains all rational numbers exactly once and in their lowest terms. We formalise the Stern-Brocot tree as… (More)

Is this relevant?

2012

2012

- 2012

The Stern-Brocot tree (or rather half of it) can be defined as follows. Start with two fractions 0/1 and 1/1, forming an ordered… (More)

Is this relevant?

2012

2012

- Eur. J. Comb.
- 2012

We use child’s addition and cross-differencing to discover significant relationships for diagonals, paths and branches within the… (More)

Is this relevant?

Review

2012

Review

2012

- 2012

We study the global organization of oscillations in sigmoidal maps, a class of models which reproduces complex locking behaviors… (More)

Is this relevant?

2010

2010

- Eur. J. Comb.
- 2010

In this paper we discover an efficient method for answering two related questions involving the Stern–Brocot tree: What is the… (More)

Is this relevant?

2010

2010

- Eur. J. Comb.
- 2010

Links between the Calkin-Wilif tree and the Stern-Brocot tree are discussed answering the questions: What is the jth vertex in… (More)

Is this relevant?

2009

2009

- Math. Comput.
- 2009

Given positive integers a, b and c to compute a generating system for the numerical semigroup whose elements are all positive… (More)

Is this relevant?

2007

2007

- J. Discrete Algorithms
- 2007

In this paper we present the Stern–Brocot tree as a basis for performing exact arithmetic on rational numbers. There exists an… (More)

Is this relevant?

2005

2005

- ICMC
- 2005

The aim of this paper is to propose a natural definition of a winding number for a m-note mode, generalizing the concept of well… (More)

Is this relevant?