Related papers: Analysis of Regular Sequences: Summatory Functions…
This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length $n$ of the Sturmian…
We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…
Let $f$ be a Rademacher or Steinhaus random multiplicative function. For various arithmetically interesting subsets $\mathcal A\subseteq [1, N]\cap\mathbb N$ such that the distribution of $\sum_{n\in \mathcal A} f(n)$ is approximately…
We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort…
We consider a renewal-like recursion and prove that the solution is polynomially decaying asymptotically under suitable conditions. We prove similar results for the corresponding integral equation. In both cases coefficients and functions…
We obtain several asymptotic formulas for the sum of the divisor function $\tau(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced…
We consider the three conjectures stated in a 2003 paper of Wu, concerning the asymptotics of particular sums of products of binomials, powers and logarithms. These sums relate to the form of the regularised integrals used in loop…
We find the asymptotics of the series $\sum_{n=1}^\infty (-1)^n n^{-1} \exp(-t/n)$ as $t\to+\infty$. The answer is an oscillating function of $t$ dominated by $\exp(-(2\pi t)^{1/2})$. The intermediate step is to find the asymptotics of the…
The Euler-MacLaurin summation formula relates a sum of a function to a corresponding integral, with a remainder term. The remainder term has an asymptotic expansion, and for a typical analytic function, it is a divergent (Gevrey-1) series.…
It is our aim to establish a general analytic theory of asymptotic expansions of type f(x)=a_1 phi_1(x)+dots+ a_n phi_n(x)+o(phi_n(x)), x tends to x_0 (*), where the given ordered n-tuple of real-valued functions phi_1 dots,phi_n forms an…
One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…
It is well known that perturbative expansions of path integrals are divergent. These expansions are to be understood as asymptotic expansions, which encode the limiting behaviour of the path integral for positive small coupling.…
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…
We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{\pi^2}{12}…
Let $f_1,\ldots,f_k : \mathbb{N} \rightarrow \mathbb{C}$ be multiplicative functions taking values in the closed unit disc. Using an analytic approach in the spirit of Hal\'{a}sz' mean value theorem, we compute multidimensional averages of…
We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely) decide if computed values are polynomially…
The paper considers the properties of pseudo stationarity in a broad sense and pseudo strong mixing for sequences of random variables corresponding to arithmetic functions. Assertions on this topic have been proven. The implementation of…
In this article we extend a theorem of Andrews, Crippa, and Simon on the asymptotic behavior of polynomials defined by a general class of recursive equations. Here the polynomials are in the variable $q$, and the recursive definition at…
For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length…
This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…