Forests of complex numbers
From MaRDI portal
Publication:3179500
Abstract: The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form , where are and are relatively prime positive integers. In this paper, certain subsemigroups of the modular group are used to construct similar trees in the set of positive complex numbers. Associated to each semigroup is a forest of trees that partitions . The set of cusps and the fundamental domain of the semigroup are defined and computed.
Recommendations
Cites work
- scientific article; zbMATH DE number 4187932 (Why is no real title available?)
- A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE
- A forest of linear fractional transformations
- A variation of the Stern-Brocot tree
- Analogs of the Stern sequence
- FUNCTIONAL PEARL: Enumerating the rationals
- Free monoids and forests of rational numbers
- Linking the Calkin-Wilf and Stern-Brocot trees
- Orphans in forests of linear fractional transformations
- Pairs of Matrices in <em>GL</em><sub>2</sub>(R<sub>≥0</sub>) That Freely Generate
- Recounting the Rationals
- The \((u,v)\)-Calkin-Wilf forest
- The \(q\)-Calkin-Wilf tree
- Two further generalizations of the Calkin-Wilf tree
Cited in
(4)
This page was built for publication: Forests of complex numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179500)