Abstract
Divide-and-conquer dividing by a half recurrences, of the form x n = 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. These equations are usually “solved” by means of a Master Theorem that provides a bound for the growing order of xn, but not the solution’s explicit expression. In this paper we give a finite explicit expression for this solution, in terms of the binary decomposition of n, when the independent term p(n) is a polynomial in ⌈n/2⌉ and ⌊n/2⌋. As an application, we obtain explicit formulas for several sequences of interest in phylogenetics, combinatorics, and computer science, for which no such formulas were known so far: for instance, for the Total Cophenetic index and the rooted Quartet index of the maximally balanced bifurcating phylogenetic trees with n leaves, and the sum of the bitwise AND operator applied to pairs of complementary numbers up to n.
Funder
Ministerio de Ciencia e Innovación
Publisher
Public Library of Science (PLoS)
Reference45 articles.
1. R. Stephan. Some Divide and Conquer Sequences with (relatively) Simple Ordinary Generating Functions. OEIS (2014), https://oeis.org/somedcgf.html.
2. Executive document: Evolution, science and society: Evolutionary biology and the National Research Agenda;D. J. Futuyma;The American Naturalist,2001