Two Binary trees of Rational numbers -- the S-tree and the SC-tree

Ziting Wang; Ruijia Guo; Yixin Zhu

Home/Archive/arXiv

arXiv · 2401.02434

Two Binary trees of Rational numbers -- the S-tree and the SC-tree

Ziting Wang·Ruijia Guo·Yixin Zhu

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this study, we explore a novel approach to demonstrate the countability of rational numbers and illustrate the relationship between the Calkin-Wilf tree and the Stern-Brocot tree in a more intuitive manner. By employing a growth pattern akin to that of the Calkin-Wilf tree, we construct the S-tree and establish a one-to-one correspondence between the vertices of the S-tree and the rational numbers in the interval $(0,1]$ using 0-1 sequences. To broaden the scope of this concept, we further develop the SC-tree, which is proven to encompass all positive rational numbers, with each rational number appearing only once. We also delve into the interplay among these four trees and offer some applications for the newly introduced tree structures.

Explore related subjects

math.HO

Keep this discovery

BibTeX RIS

Ziting Wang, Ruijia Guo, Yixin Zhu. 2023-11-16. Two Binary trees of Rational numbers -- the S-tree and the SC-tree. https://arxiv.org/abs/2401.02434

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO↗

arXiv2026

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO↗

arXiv2026

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO↗