Related papers: Asymptotics of Landau--Okhotin function

Let $LA_{n}(\tau)$ be the length of the longest alternating subsequence of a uniform random permutation $\tau\in[n]$. Classical probabilistic arguments are used to rederive the asymptotic mean, variance and limiting law of $LA_{n}(\tau)$.…

We introduce a certain variant (or regularization) $\tilde{\Lambda}^\mu_n$ of the standard Christoffel function $\Lambda^\mu_n$ associated with a measure $\mu$ on a compact set $\Omega\subset \mathbb{R}^d$. Its reciprocal is now a…

We compute the leading asymptotics of the maximum of the (centered) logarithm of the absolute value of the characteristic polynomial, denoted $\Psi_N$, of the Ginibre ensemble as the dimension $N$ of the random matrix tends to infinity. The…

For a finite group $G$ and a non-negative integer $d$, denote by $\Omega_d(G)$ the number of functions $G^d\rightarrow G$ that are induced by substitution into a word with variables among $X_1,\ldots,X_d$. In this note, we show that…

Let $\tau_k(n)$ be the $k$-th divisor function. In this paper, we derive an asymptotic formula for the sum $$ \sum_{1\leq n_1,n_2, \dots, n_{\ell}\leq X^{\frac{1}{r}} \atop 1\leq n_{\ell+1}\le X^{\frac{1}{s}}}\tau_k(n_1^r+n_2^r+\dots…

Let $\overline{p}(n)$ denote the overpartition function, and for $j\in \mathbb{N}$, $\Delta^r_j$ denote the $r$-fold applications of the shifted difference operator $\Delta_j$ defined by $\Delta_j(a)(n):=a(n)-a(n-j)$. The main goal of this…

Let G be a graph of order n and let q(G) be that largest eigenvalue of the signless Laplacian of G. In this note it is shown that if k>1 and q(G)>=n+2k-2, then G contains cycles of length l whenever 2<l<2k+3. This bound is asymptotically…

For a positive integer $n>1$ denote by $\omega(n)$ the maximal possible number $k$ of different functions $f_1,\dots,f_k:\mathbb{Z}/n\mathbb{Z}\mapsto \mathbb{Z}/n\mathbb{Z}$ such that each function $f_i-f_j,i<j$, is bijective. Recently A.…

We prove relative asymptotic for the ratio of two sequences of multiple orthogonal polynomials with respect to Nikishin system of measures. The first Nikishin system ${\mathcal{N}}(\sigma_1,...,\sigma_m)$ is such that for each $k$,…

We prove a new bound on the average sensitivity of polynomial threshold functions. In particular we show that a polynomial threshold function of degree $d$ in at most $n$ variables has average sensitivity at most…

We prove that the greatest positive integer that is not expressible as a linear combination with integer coefficients of elements of the set $\{n^2,(n+1)^2,\ldots \}$ is asymptotically $O(n^2)$, verifying thus a conjecture of Dutch and…

Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…

Markoff-Lagrange spectrum uncovers exotic topological properties of Diophantine approximation. We investigate asymptotic properties of geometric progressions modulo one and observe significantly analogous results on the set \[ {\mathcal…

Let $a \geq 2$ be an integer. We prove that for every periodic sequence $(s_n)_{n \geq 1}$ in $\{-1, +1\}$ there exists an effectively computable rational number $C_\mathbf{s} > 0$ such that \begin{equation*} \log\operatorname{lcm}(a + s_1,…

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

We determine asymptotically the maximal order of log d(d(n)), where d(n) is the number of positive divisors of n. This solves a problem first put forth by Ramanujan in 1915.

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…

Assuming a conjecture on distinct zeros of Dirichlet L-functions we get asymptotic results on the average number of representations of an integer as the sum of two primes in arithmetic progression. On the other hand the existence of good…

In this article, I derive a new approach to estimate the number of non-trivial zeros of a given Dedekind zeta function with absolute height at most $T\geq1$ counted with multiplicity. The error term in corresponding asymptotic formula…