Left–right pairs and complex forests of infinite rooted binary trees
From MaRDI portal
Publication:3303492
DOI10.1142/S1793042120500864zbMath1445.05029arXiv1810.04349MaRDI QIDQ3303492
Publication date: 11 August 2020
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.04349
Trees (05C05) Combinatorial identities, bijective combinatorics (05A19) Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)
Cites Work
- Unnamed Item
- A variation of the Stern-Brocot tree
- Two further generalizations of the Calkin-Wilf tree
- Free monoids and forests of rational numbers
- Linking the Calkin-Wilf and Stern-Brocot trees
- The \(q\)-Calkin-Wilf tree
- Recounting the Rationals
- The (u,v)-Calkin–Wilf forest
- Analogs of the Stern Sequence
- Forests of complex numbers
- A POLYNOMIAL ANALOGUE TO THE STERN SEQUENCE
- Pairs of Matrices in <em>GL</em><sub>2</sub>(R<sub>≥0</sub>) That Freely Generate
- A forest of linear fractional transformations
- FUNCTIONAL PEARL: Enumerating the rationals
This page was built for publication: Left–right pairs and complex forests of infinite rooted binary trees