Related papers: Averaging on thin sets of diagonal forms
We study the asymptotic convergence of the partial averaging method, a technique used in conjunction with the random series implementation of the Feynman-Kac formula. We prove asymptotic bounds valid for most series representations in the…
A survey of recent results in elementary number theory is presented in this paper. Special attention is given to structure and asymptotic properties of certain families of positive integers.
An atomic random complex measure defined on the unit disk with Normally distributed moments is considered. An approximation to the distribution of the zeros of its Cauchy transform is computed. Implications of this result for solving…
We prove the asymptotic large volume expression of diagonal form factors in integrable models by evaluating carefully the diagonal limit of a non-diagonal form factor in which we send the rapidity of the extra particle to infinity.
We give an asymptotic for the number of prime solutions to $Q(x_1,\dots, x_8) = N$, subject to a mild non-degeneracy condition on the homogeneous quadratic form $Q$. The argument initially proceeds via the circle method, but this does not…
Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…
Let K be a number field, and let a be a non-zero element of K. Fix some prime number l. We compute the density of the following set: the primes p of K such that the multiplicative order of the reduction of a modulo p is coprime to l (or,…
Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…
We consider high-dimensional estimation problems where the number of parameters diverges with the sample size. General conditions are established for consistency, uniqueness, and asymptotic normality in both unpenalized and penalized…
We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.
There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…
We prove an asymptotic formula for the mean-square average of $L$- functions associated to subgroups of characters of sufficiently large size. Our proof relies on the study of certain character sums ${\cal A}(p,d)$ recently introduced by E.…
We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…
We introduce amorphic complexity as a new topological invariant that measures the complexity of dynamical systems in the regime of zero entropy. Its main purpose is to detect the very onset of disorder in the asymptotic behaviour. For…
We derive the local and central limit theorems for the Stirling numbers of the second kind by elementary means, obtaining as corollaries effective asymptotic estimates for the Bell numbers and for the moments of the distribution. We also…
We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…
We study p-adic counterparts of stable distributions, that is limit distributions for sequences of normalized sums of independent identically distributed p-adic-valued random variables. In contrast to the classical case, non-degenerate…
Let $s \geq 3$ be a fixed positive integer and $a_1,\dots,a_s \in \mathbb{Z}$ be arbitrary. We show that, on average over $k$, the density of numbers represented by the degree $k$ diagonal form \[ a_1 x_1^k + \cdots + a_s x_s^k \] decays…
In this paper, we study the average size of the product of a number and its multiplicative inverse modulo a prime p. This turns out to be related to moments of L-functions and leads to a curious asymptotic formula for a certain triple…
One of the questions of distribution of prime numbers is considered in the article. It is shown what error is obtained from the assumption that the asymptotic density of a sequence of primes is a probability. Various forms of an analogue of…