$(u,v)$ -Calkin-Wilf树中行的平均值
Mean Row Values in $(u,v)$-Calkin-Wilf Trees
摘要:
我们固定整数$u,v \geq 1$,并考虑一个无限二叉树$\mathcal{T}^{(u,v)}(z)$的根节点的值是一个正有理数$z$。对于每个顶点$a/b$,我们将左子节点标记为$a/(ua+b)$,右子节点标记为$(a+vb)/b$。生成的树被称为$(u,v)$-Calkin-Wilf树。当$z$在$[1/u,v]\cap \mathbb{Q}$上运行时,$\mathcal{T}^{(u,v)}(z)$的顶点集形成$\mathbb{Q}^+$的分区。当$u=v=1$时,随着行深度的增加,平均行值收敛到$3/2$。我们的目标是将这个结果推广到任何$u,v\geq 1$。我们表明,当$z\in [1/u,v]\cap \mathbb{Q}$,平均行值在$\mathcal{T}^{(u,v)}(z)$收敛到一个值接近$v+\log 2/u$一致$z$。
英文摘要:
We fix integers $u,v \geq 1$, and consider an infinite binary tree $\mathcal{T}^{(u,v)}(z)$ with a root node whose value is a positive rational number $z$. For every vertex $a/b$, we label the left child as $a/(ua+b)$ and right child as $(a+vb)/b$. The resulting tree is known as the $(u,v)$-Calkin-Wilf tree. As $z$ runs over $[1/u,v]\cap \mathbb{Q}$, the vertex sets of $\mathcal{T}^{(u,v)}(z)$ form a partition of $\mathbb{Q}^+$. When $u=v=1$, the mean row value converges to $3/2$ as the row depth increases. Our goal is to extend this result for any $u,v\geq 1$. We show that, when $z\in [1/u,v]\cap \mathbb{Q}$, the mean row value in $\mathcal{T}^{(u,v)}(z)$ converges to a value close to $v+\log 2/u$ uniformly on $z$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。