Multidimensional Divide-and-Conquer and Weighted Digital Sums
Y. K. Cheung, Philippe Flajolet, Mordecai Golin, C. Y. James Lee

TL;DR
This paper provides exact asymptotic solutions for functions from multidimensional divide-and-conquer algorithms and digital sums, revealing periodic fluctuations characterized by Fourier series.
Contribution
It introduces a unified Mellin transform approach to analyze three types of functions, deriving explicit asymptotic forms with periodic components.
Findings
MDC functions have solutions involving polynomial and periodic terms.
Weighted digital sums' averages are expressed with logarithmic and periodic functions.
Results include explicit formulas with Fourier series for the asymptotic behavior.
Abstract
This paper studies three types of functions arising separately in the analysis of algorithms that we analyze exactly using similar Mellin transform techniques. The first is the solution to a Multidimensional Divide-and-Conquer (MDC) recurrence that arises when solving problems on points in -dimensional space. The second involves weighted digital sums. Write in its binary representation and set . We analyze the average . The third is a different variant of weighted digital sums. Write as with and set . We analyze the average . We show that both the MDC functions and (with ) have solutions of the form…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Theories and Applications · Advanced Mathematical Theories
