Laura Monroe
Abstract
Open-access reader
The number of unbalanced interior nodes of divide-and-conquer trees on $n$ leaves is known to form a sequence of dilations of the Takagi function on dyadic rationals. We use this fact to derive identities on the Takagi function and on the Hamming weight of an integer in terms of the Takagi function.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The number of unbalanced interior nodes of divide-and-conquer trees on $n$ leaves is known to form a sequence of dilations of the Takagi function on dyadic rationals. We use this fact to derive identities on the Takagi function and on the Hamming weight of an integer in terms of the Takagi function.
Key concepts: Rational number, Function (biology), Integer (computer science), Mathematics, Sequence (biology), Rational function, Combinatorics, Discrete mathematics