Related papers: A simple master Theorem for discrete divide and co…

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…

For a wide class of sequences of integer domains $\mathcal{D}_n\subset\mathbb{N}^d$, $n\in\mathbb{N}$, we prove distributional limit theorems for $F(X_1^{(n)},\ldots,X_d^{(n)})$, where $F$ is a multivariate multiplicative function and…

Let $d(N )$ (resp. $p(N )$) be the number of summands in the determinant (resp. permanent) of an $N\times N$ circulant matrix $A = (a_{ij} )$ given by $a_{ij} = X_{i+j}$ where $i + j$ should be considered $\mod N$ . This short note is…

In computer science, divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A D&C algorithm works by recursively and monotonically breaking down a problem into sub problems of the same (or a related)…

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

The dollar game is a chip-firing game introduced by Baker and Norine (2007) as a context in which to formulate and prove the Riemann-Roch theorem for graphs. A divisor on a graph is a formal integer sum of vertices. Each determines a dollar…

We study the singularity probability of n*n random matrices with i.i.d. entries from highly biased discrete distributions. We obtain sharp non-asymptotic bounds for this probability and derive estimates on the least singular values. Our…

We study the lower tail behavior of the least singular value of an $n\times n$ random matrix $M_n := M+N_n$, where $M$ is a fixed complex matrix with operator norm at most $\exp(n^{c})$ and $N_n$ is a random matrix, each of whose entries is…

We present a short proof of Jin's theorem which is entirely elementary, in the sense that no use is made of nonstandard analysis, ergodic theory, measure theory, ultrafilters, or other advanced tools. The given proof provides the explicit…

We propose results of the investigation of properties of the random sums of random variables. We consider the case, where the number of summands is the first moment of an event occurrence. An integral equation is presented that determines…

We prove a version of a general transfer theorem for random sequences with independent random indexes in the double array limit setting under relaxed conditions. We also prove its partial inverse providing the necessary and sufficient…

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk…

In this paper, we consider networks with topologies described by some connected undirected graph ${\mathcal{G}}=(V, E)$ and with some agents (fusion centers) equipped with processing power and local peer-to-peer communication, and…

Ramanujan's Master theorem states that, under suitable conditions, the Mellin transform of a power series provides an interpolation formula for the coefficients of this series. Based on the duality of Riemannian symmetric spaces of compact…

We investigate arithmetic properties of the sequence b(n) = B_MN(n) mod M obtained from the base-M to base-N shift map B_MN.We prove that b(n) is ultimately periodic exactly when every prime divisor of M also divides N; in that case we…

The $j$th divisor function $d_j$, which counts the ordered factorisations of a positive integer into $j$ positive integer factors, is a very well-known arithmetic function; in particular, $d_2(n)$ gives the number of divisors of $n$.…

We study discrete expressions of the form $$ T_n(g)=\sum_{i=1}^n a_i g(S_i), \qquad S_i=\sum_{j=1}^i a_j, $$ where $a_i>0$ and $\sum_{i=1}^n a_i=1$. If $g:[0,1]\to\mathbb{R}$ is a decreasing integrable function, we have $$ \sum_{i=1}^n a_i…

For $n\ge 1$, let $T_n$ be a random recursive tree on the vertex set $[n]=\{1,\ldots,n\}$. Let $\mathrm{deg}_{T_n}(v)$ be the degree of vertex $v$ in $T_n$, that is, the number of children of $v$ in $T_n$. Devroye and Lu showed that the…