# Identities and periodic oscillations of divide-and-conquer recurrences splitting at half

We study divide-and-conquer recurrences of the form f(n) = α f(⌊ n2⌋) + β f(⌈ n2⌉) + g(n) (n≥2), with g(n) and f(1) given, where α,β≥0 with α+β>0; such recurrences appear often in analysis of computer algorithms, numeration systems, combinatorial sequences, and related areas. We show that the solution satisfies always the simple identity f(n) = n^log_2(α+β) P(log_2n) - Q(n) under an optimum (iff) condition on g(n). This form is not only an identity but also an asymptotic expansion because Q(n) is of a smaller order. Explicit forms for the continuity of the periodic function P are provided, together with a few other smoothness properties. We show how our results can be easily applied to many dozens of concrete examples collected from the literature, and how they can be extended in various directions. Our method of proof is surprisingly simple and elementary, but leads to the strongest types of results for all examples to which our theory applies.

READ FULL TEXT