Stern–Brocot tree

Known as: Farey tree, Stern Brocot tree, Stern-brocot tree

In number theory, the Stern–Brocot tree is an infinite complete binary tree in which the vertices correspond one-for-one to the positive rational…

Papers overview

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

2009

We study partitions of an integer n in which all parts are powers of 2, no power of 2 appearing more than twice. If b(n) is the…

2009

To generate believable virtual characters in real-time is a key issue to improve users’ engaging experience in the interactive…

2006

Abstract Fragments of the melting furnace and several crucibles of the glassworks of Derrière Sairoche are compared with local…

2006

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…

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…

2004

We present a new class of on-demand routing protocols called split label routing (SLR). The protocols guarantee loop-freedom at…

1999

Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square…

1991

1986

1981