Explicit solution of divide-and-conquer dividing by a half recurrences with polynomial independent term

11/24/2021
by   Tomás M. Coronado, et al.
0

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. 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_n of a recurrence of this form, with given initial condition x_1, when the independent term p(n) is a polynomial in ⌈n/2⌉ and ⌊n/2⌋.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2022

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

We study divide-and-conquer recurrences of the form f(n) = α ...
research
01/15/2001

Multiple-Size Divide-and-Conquer Recurrences

This short note reports a master theorem on tight asymptotic solutions t...
research
12/05/2019

Towards identification of explicit solutions to overdetermined systems of differential equations

The authors proposed a general way to find particular solutions for over...
research
01/09/2023

A family of explicit Waring decompositions of a polynomial

In this paper we settle some polynomial identity which provides a family...
research
07/10/2022

Opposing Half Guards

We study the art gallery problem for opposing half guards: guards that c...
research
10/01/2021

Towards Generalised Half-Duplex Systems

FIFO automata are finite state machines communicating through FIFO queue...
research
08/26/2023

A Graph-Theoretic Model for a Generic Three Jug Puzzle

In a classic three jug puzzle we have three jugs A, B, and C with some f...

Please sign up or login with your details

Forgot password? Click here to reset