Related papers: Distribution of the Error in Estimated Numbers of …
A distributed algorithm is described for finding a common fixed point of a family of $m>1$ nonlinear maps $M_i : \mathbb{R}^n \rightarrow \mathbb{R}^n$ assuming that each map is a paracontraction and that such a common fixed point exists.…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
We investigate the distribution of real algebraic numbers of a fixed degree having a close conjugate number, the distance between the conjugate numbers being given as a function of their height. The main result establishes the ubiquity of…
We prove a logarithmic estimate in the Hardy-Sobolev space $H^{k, 2}$, $k$ a positive integer, of the unit disk ${\mathbb D}$. This estimate extends those previously established by L. Baratchart and M. Zerner in $H^{1,2}$ and by S. Chaabane…
In this paper, a reliable a posteriori error estimator for a model problem of elastoplasticity with linear kinematic hardening is derived, which satisfies some (local) efficiency estimates. It is applicable to any discretization that is…
We consider distributed statistical optimization in one-shot setting, where there are $m$ machines each observing $n$ i.i.d. samples. Based on its observed samples, each machine sends a $B$-bit-long message to a server. The server then…
The goal of this paper is to analyze the discrete Lambert map x to xg^x modulo a power of a prime p which is important for security and verification of the ElGamal digital signature scheme. We use p-adic methods (p-adic interpolation and…
Following Baraud, Birg\'e and Sart (2017), we pursue our attempt to design a robust universal estimator of the joint ditribution of $n$ independent (but not necessarily i.i.d.) observations for an Hellinger-type loss. Given such…
In \cite{joux}, Joux devised an algorithm to compute discrete logarithms between elements in a certain subset of the multiplicative group of an extension of the finite field $\mathbb{F}_{p^n}$ in time polynomial in $p$ and $n$. Shortly…
We present a detailed study of roundoff errors in probabilistic floating-point computations. We derive closed-form expressions for the distribution of roundoff errors associated with a random variable, and we prove that roundoff errors are…
We prove new results on the additive theory of reversed primes $\overleftarrow{p}$; that is, primes $p$ which are written backwards in a fixed base $b\geq 2$. In particular, we study a variant of Goldbach's conjecture, looking at…
We study the problem of nonparametric estimation of the fractional derivative of unknown distribution function and of spectral function and show that these problems are well posed when the order of derivative is less than 0.5. We prove also…
In this paper, we establish error estimates for a fully discrete, filtered Lie splitting scheme applied directly to the Zakharov system -- a model whose solutions may exhibit extremely low regularity in arbitrary dimensions. Remarkably, we…
This monograph considers a few topics in the theory of primitive roots g(p) modulo a prime p>=2. A few estimates of the least primitive roots g(p) and the least prime primitive roots g^*(p) modulo p, a large prime, are determined. One of…
In this follow-up paper, we again inspect a surprising relationship between the set of fixed points of a polynomial map $\varphi_{d, c}$ defined by $\varphi_{d, c}(z) = z^d + c$ for all $c, z \in \mathcal{O}_{K}$ or $\in \mathbb{Z}_{p}$ or…
We study the problem of list-decodable sparse mean estimation. Specifically, for a parameter $\alpha \in (0, 1/2)$, we are given $m$ points in $\mathbb{R}^n$, $\lfloor \alpha m \rfloor$ of which are i.i.d. samples from a distribution $D$…
In this paper, we will give some estimation for the average error of the prime number theorem.
The classic problems of testing uniformity of and learning a discrete distribution, given access to independent samples from it, are examined under general $\ell_p$ metrics. The intuitions and results often contrast with the classic…
The question of optimally approximating an arbitrary probability measure in the Wasserstein distance by a discrete one with uniform weights is considered. Estimates are obtained for the optimal approximation distance, with an explicit rate…
According to a general probabilistic principle, the natural divisors of friable integers (i.e.~free of large prime factors) should normally present a Gaussian distribution. We show that this indeed is the case with conditional density…