2000 character limit reached
The (u,v)-Calkin-Wilf Forest
Published 6 Nov 2014 in math.NT and math.CO | (1411.1747v2)
Abstract: In this paper we consider a refinement, due to Nathanson, of the Calkin-Wilf tree. In particular, we study the properties of such trees associated with the matrices $L_u=\begin{bmatrix} 1 & 0 \ u & 1\end{bmatrix}$ and $R_v=\begin{bmatrix} 1 & v \ 0& 1\end{bmatrix}$, where $u$ and $v$ are nonnegative integers. We extend several known results of the original Calkin-Wilf tree, including the symmetry, numerator-denominator, and successor formulas, to this new setting. Additionally, we study the ancestry of a rational number appearing in a generalized Calkin-Wilf tree.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.