Distant parents in complete binary trees
From MaRDI portal
Publication:5401243
zbMATH Open1288.05044arXiv1405.5624MaRDI QIDQ5401243
Publication date: 12 March 2014
Abstract: There is a unique path from the root of a tree to any other vertex. Every vertex, except the root, has a parent: the adjoining vertex on this unique path. This is the conventional definition of the parent vertex. For complete binary trees, however, we show that it is useful to define another parent vertex, called a emph{distant parent}. The study of distant parents leads to novel connections with dyadic rational numbers. Moreover, we apply the concepts of close and distant parent vertices to deduce an apparently new sense in which continued fractions are `best' rational approximations.
Full work available at URL: https://arxiv.org/abs/1405.5624
This page was built for publication: Distant parents in complete binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401243)
