The Calkin-Wilf Tree is a binary tree of positive rational numbers in which each node is labeled with a unique fraction, generated by starting at 1/1 and recursively applying the rule that the left child of a fraction \( \frac{a}{b} \) is \( \frac{a}{a+b} \) and the right child is \( \frac{a+b}{b} \), thereby enumerating all positive rationals without duplication.
3
Publications
51
Citations
6
Authors
3
Institutions
Publications per year
2017–2026
0
Parents
Publications
3
Two further generalizations of the Calkin–Wilf tree
Toufik Mansour, Mark Shattuck · Journal of Combinatorics · 2011 · 11 citations · Full text
Shôichirô Sakai · American Journal of Mathematics · 1966 · 11 citations
Sandie Han, Ariane M. Masuda, Satyanand Singh et al. · International Journal of Number Theory · 2015 · 10 citations · Full text
1–5 of 3
Authors
6
- BB
1
h-index
- SS
1
h-index
- MS
1
h-index
- KT
1
h-index
- MW
1
h-index
1–5 of 6
Institutions
3
University of Haifa
Haifa, Israel
1 h-index
1 publications
11 citations
University of Tennessee at Knoxville
Knoxville, United States
1 h-index
1 publications
11 citations
University of Wollongong
Wollongong, Australia
1 h-index
3 publications
87 citations
City University of New York
New York, United States
1 publications
10 citations
New York City College of Technology
Brooklyn, United States
1 publications
10 citations
University of Turku
Turku, Finland
1 publications
28 citations
Université du Québec à Montréal
Montreal, Canada
1 publications
28 citations
University of Naples Federico II
Naples, Italy
1 publications
28 citations
1–8 of 3
Venues
- American Journal of Mathematics
1 publications · 11 citations
1
h-index
- Journal of Combinatorics
JOC · 1 publications · 11 citations
1
h-index
- European Journal of Combinatorics
1 publications · 29 citations
1
h-index
- International Journal of Number Theory
IJNT · 1 publications · 10 citations
- The Electronic Journal of Combinatorics
1 publications · 28 citations
1–5