Related papers: Uniform estimates for almost primes over finite fi…

Asymptotic approximations of Jacobi polynomials are given in terms of elementary functions for large degree $n$ and parameters $\alpha$ and $\beta$. From these new results, asymptotic expansions of the zeros are derived and methods are…

We analyze the asymptotic behavior of the Apostol-Bernoulli polynomials $\mathcal{B}_{n}(x;\lambda)$ in detail. The starting point is their Fourier series on $[0,1]$ which, it is shown, remains valid as an asymptotic expansion over compact…

The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…

We give more evidence for Patterson's conjecture on sums of exponential sums, by getting an asymptotic for a sum of quartic exponential sums over $\Q[i].$ Previously, the strongest evidence of Patterson's conjecture over a number field is…

We apply the Euler--Maclaurin formula to find the asymptotic expansion of the sums $\sum_{k=1}^n (\log k)^p / k^q$, ~$\sum k^q (\log k)^p$, ~$\sum (\log k)^p /(n-k)^q$, ~$\sum 1/k^q (\log k)^p $ in closed form to arbitrary order ($p,q…

We prove an asymptotic formula for class numbers of totlally imaginary quartic number fields, ie for number fields of degree 4 over Q with only complex embeddings. After previous work for real quadratic fields (Sarnak) and complex cubic…

An asymptotic formula for the variance of squarefree numbers in arithmetic progressions of given modulus was obtained by Nunes (see reference [3]). We improve one of the error terms.

We provide a combinatorial derivation of an asymptotic formula for averages of mixed ratios of characteristic polynomials over the unitary group, where mixed ratios are products of ratios and/or logarithmic derivatives. Our proof of this…

Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…

We provide the detailed asymptotic behavior for first-order aggregation models of heterogeneous oscillators. Due to the dissimilarity of natural frequencies, one could expect that all relative distances converge to definite positive value…

We estimate several probability distributions arising from the study of random, monic polynomials of degree $n$ with coefficients in the integers of a general $p$-adic field $K_{\mathfrak{p}}$ having residue field with $q= p^f$ elements. We…

Let $E$ be an elliptic curve defined over the rational numbers and $r$ a fixed integer. Using a probabilistic model consistent with the Chebotarev theorem for the division fields of $E$ and the Sato-Tate distribution, Lang and Trotter…

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $f \in \mathbb{F}_{q}[x]$ be a polynomial of degree $d > 0$. Denote the image set of this polynomial as $V_{f}=\{f(\alpha)\mid\alpha\in\mathbb{F}_{q}\}$ and denote the…

Consider the set of all error--correcting block codes over a fixed alphabet with $q$ letters. It determines a recursively enumerable set of points in the unit square with coordinates $(R,\delta)$:= {\it (relative transmission rate, relative…

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. Furthermore, let $\mid A(n)\mid$ denote the cardinality of the set $A(n)=A\cap [n]$. The limit…

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}…

We prove asymptotic formulae for sums of the form $$ \sum_{n\in\mathbb{Z}^d\cap K}\prod_{i=1}^tF_i(\psi_i(n)), $$ where $K$ is a convex body, each $F_i$ is either the von Mangoldt function or the representation function of a quadratic form,…

We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…

For a prime power $q$, let $\alpha_q$ be the standard function in the asymptotic theory of codes, that is, $\alpha_q(\delta)$ is the largest asymptotic information rate that can be achieved for a given asymptotic relative minimum distance…

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…