Related papers: Multiple-Size Divide-and-Conquer Recurrences
The aim of this note is to provide a Master Theorem for some discrete divide and conquer recurrences: $$X_{n}=a_n+\sum_{j=1}^m b_j X_{\lfloor{\frac{n}{m_j}}\rfloor},$$ where the $m_i$'s are integers with $m_i\ge 2$. The main novelty of this…
We give here a general, best-possible, and smoothly-derived form of the Master Theorem for divide-and-conquer recurrences.
We provide geometrical interpretation of the Master Theorem to solve divide-and-conquer recurrences. We show how different cases of the recurrences correspond to different kinds of fractal images. Fractal dimension and Hausdorff measure are…
Divide-and-conquer dividing by a half recurrences, of the form $x_n =a\cdot x_{\left\lceil{n}/{2}\right\rceil}+a\cdot x_{\left\lfloor{n}/{2}\right\rfloor}+p(n)$, $n\geq 2$, appear in many areas of applied mathematics, from the analysis of…
Some changes in a recent convolution formula are performed here in order to clean it up by using more conventional notations and by making use of more referrenced and documented components (namely Sierpi\'nski's polynomials, the Thue-Morse…
This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall…
The divide-and-conquer framework, used extensively in classical algorithm design, recursively breaks a problem of size $n$ into smaller subproblems (say, $a$ copies of size $n/b$ each), along with some auxiliary work of cost…
In the asymptotic analysis of regular sequences as defined by Allouche and Shallit, it is usually advisable to study their summatory function because the original sequence has a too fluctuating behaviour. It might be that the process of…
The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…
Under a map T, a point x recurs at rate given by a sequence {r_n} near a point x_0 if d(T^n(x),x_0)< r_n infinitely often. Let us fix x_0, and consider the set of those x's. In this paper, we study the size of this set for expanding maps…
Standard techniques for treating linear recurrences no longer apply for quadratic recurrences. It is not hard to determine asymptotics for a specific parametrized model over a wide domain of values (all $p \neq 1/2$ here). The gap between…
We study divide-and-conquer recurrences of the form \begin{equation*} f(n) = \alpha f(\lfloor \tfrac n2\rfloor) + \beta f(\lceil \tfrac n2\rceil) + g(n) \qquad(n\ge2), \end{equation*} with $g(n)$ and $f(1)$ given, where $\alpha,\beta\ge0$…
Let t[n] be a sequence that satisfies a first order homogeneous recurrence t[n] = Q[n]*t[n-1], where Q is a polynomial with integer coefficients. The asymptotic behavior of the p-adic valuation of t[n] is described under the assumption that…
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…
For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…
Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
A tournament on a graph is an orientation of its edges. The score sequence lists the in-degrees in non-decreasing order. Works by Winston and Kleitman (1983) and Kim and Pittel (2000) showed that the number $S_n$ of score sequences on the…
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…