Calkin–Wilf tree

Known as: Neil Calkin, Fusc, Calkin-Wilf tree 
In number theory, the Calkin–Wilf tree is a tree in which the vertices correspond 1-for-1 to the positive rational numbers. The tree is rooted at the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2003-2016
01220032016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
  • Timothy B. Flowers, Shannon R. Lockard
  • 2016
The Calkin-Wilf tree is well-known as one way to enumerate the rationals, but also may be used to count hyperbinary partitions of… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
We define a q-analogue of the Calkin–Wilf tree and the Calkin–Wilf sequence. We show that the nth term f (n; q) of the q-analogue… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
In this note we present some results on the Calkin-Wilf tree of irreducible fractions, giving an insight on the duality relating… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2010
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?
2007
2007
We examine statistical properties of the Calkin–Wilf tree and give number-theoretical applications. 1. A mean-value related to… (More)
Is this relevant?
Review
2005
Review
2005
The aim of this work is to give an overview of the theory of e cient alpha-beta-searches in computer chess and to explain the… (More)
Is this relevant?
2004
2004
An attempt to use the while macro, [14], was the origin of writing this article. The while semantics, as given by J.-C. Chen, is… (More)
Is this relevant?
2004
2004
In two articles (this one and [4]) we discuss correctness of two short programs for the SCM machine: one computes Fibonacci… (More)
Is this relevant?
2004
2004
We present a series of lazy functional programs for enumerating the rational numbers without duplication, drawing on some elegant… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2003
2003
In two articles (this one and [3]) we discuss correctness of two short programs for the SCM machine: one computes Fibonacci… (More)
Is this relevant?