Related papers: Asymptotics of the order statistics for a process …

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : \Omega(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$\pi_k(x):=\ \mid\{n\leq x :…

Let $G$ be a finite group and let $\psi(G)$ denote the sum of element orders of $G$. It is well-known that the maximum value of $\varphi$ on the set of groups of order $n$, where $n$ is a positive integer, will occur at the cyclic group…

Motivated by earlier work of P.~A.~MacMahon and recent contributions of T.~Amdeberhan, G.~E.~Andrews, K.~Ono, A.~Singh, and R.~Tauraso on higher-order partition enumerants, we study a class of $q$-series arising from nested divisor…

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

We introduce a family of averaged meta-Fibonacci recursions $$ Q_{\alpha,m}(n) = 1+ \left\lfloor \alpha \frac1m \sum_{j=1}^m Q_{\alpha,m}(n-Q_{\alpha,m}(n-j)) \right\rfloor , $$ with initial conditions $$…

Iteration of randomly chosen quadratic maps defines a Markov process: X_{n+1}=\epsilon_{n+1}X_n(1-X_n), where \epsilon_n are i.i.d. with values in the parameter space [0,4] of quadratic maps F_{\theta}(x)=\theta x(1-x). Its study is of…

We consider a misspecified optimization problem that requires minimizing a function f(x;q*) over a closed and convex set X where q* is an unknown vector of parameters that may be learnt by a parallel learning process. In this context, We…

We give analogues in the finite general linear group of two elementary results concerning long cycles and transpositions in the symmetric group: first, that the long cycles are precisely the elements whose minimum-length factorizations into…

We improve Luczak's upper bounds on the length of the longest cycle in the random graph G(n,M) in the "supercritical phase" where M=n/2+s and s=o(n) but n^{2/3}=o(s). The new upper bound is (6.958+o(1))s^2/n with probability 1-o(1) as n…

In this work we study complete asymptotic expansions for the q-series $\sum_{n=1}^{\infty}\frac{1}{n^{b}}q^{n^{a}}$ and $\sum_{n=1}^{\infty}\frac{\sigma_{\alpha}(n)}{n^{b}}q^{n^{a}}$ in the scale function $(\log q)^{n}$ as $q\to1^{-}$,…

We consider the recursion $X_{n+1}=\sum_{i=0}^n \epsilon_{n,i}X_{n-i}$, where $\epsilon_{n,i}$ are i.i.d. (Bernoulli) random variables taking values in $\{-1,1\}$, and $X_0=1$, $X_{-j}=0$ for $j>0$. We prove that almost surely, $n^{-1}\log…

Denote the sum of element orders in a finite group $G$ by $\psi(G)$ and let $C_n$ denote the cyclic group of order $n$. Suppose that $G$ is a non-cyclic finite group of order $n$ and $q$ is the least prime divisor of $n$. We proved that…

For each $n\geq 1$, let $ {X_{in}, \quad i \geq 1} $ be independent copies of a nonnegative continuous stochastic process $X_{n}=(X_n(t))_{t\in T}$ indexed by a compact metric space $T$. We are interested in the process of partial maxima…

We consider the excursions, i.e. the intervals between consecutive zeros, of stochastic processes that arise in a variety of nonequilibrium systems and study the temporal growth of the longest one l_{\max}(t) up to time t. For smooth…

Our object of study is the asymptotic growth of heaviest paths in a charged (weighted with signed weights) complete directed acyclic graph. Edge charges are i.i.d. random variables with common distribution $F$ supported on $[-\infty,1]$…

We compute the leading asymptotics as $N\to\infty$ of the maximum of the field $Q_N(q)= \log\det|q- A_N|$, $q\in \mathbb{C}$, for any unitarily invariant Hermitian random matrix $A_N$ associated to a non-critical real-analytic potential.…

The rate equation for an arbitrary mth order growth or decay reaction can be expressed in terms of the q-exponential function, with q equal to m. The analysis suggests that a wide variety of reaction rate (kinetic) processes and models, in…

We consider GL_n(F_q)-analogues of certain factorization problems in the symmetric group S_n: rather than counting factorizations of the long cycle (1, 2, ..., n) given the number of cycles of each factor, we count factorizations of a…

In queuing theory and related problems, it is very important to know the numerical characteristics of an investigated system - both in stationary and non-stationary modes. In some cases, such characteristics can be calculated, but this is…

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…