Papers › Explicit solution of divide-and-conquer dividing by a half recurrences with polynomial...
Explicit solution of divide-and-conquer dividing by a half recurrences with polynomial independent term
Tomás M. Coronado, Arnau Mir, Francesc Rosselló
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Divide-and-conquer dividing by a half recurrences, of the form xₙ =a·x_(⌈n/2⌉)+a·x_(⌊n/2⌋)+p(n), n≥2, appear in many areas of applied mathematics, from the analysis of algorithms to the optimization of phylogenetic balance indices. The Master Theorems that solve these equations do not provide the solution's explicit expression, only its big-Θ order of growth. In this paper we give an explicit expression (in terms of the binary decomposition of n) for the solution xₙ of a recurrence of this form, with given initial condition x₁, when the independent term p(n) is a polynomial in ⌈n/2⌉ and ⌊n/2⌋.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections