Related papers: Counting multiplicative approximations
We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 25 is the sum of at most three natural numbers whose…
This paper is concerned with estimating the intersection point of two densities, given a sample of both of the densities. This problem arises in classification theory. The main results provide lower bounds for the probability of the…
A novel method of summing asymptotic series is advanced. Such series repeatedly arise when employing perturbation theory in powers of a small parameter for complicated problems of condensed matter physics, statistical physics, and various…
We consider the three conjectures stated in a 2003 paper of Wu, concerning the asymptotics of particular sums of products of binomials, powers and logarithms. These sums relate to the form of the regularised integrals used in loop…
Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of…
The goal of this work is to prove an analogue of a recent result of Harper on almost sure lower bounds of random multiplicative functions, in a setting that can be thought of as a simplified function field analogue. It answers a question…
Starting from the first Hardy-Littlewood conjecture some topics will be covered: an empirical approach to the distribution of the twin primes in classes mod(10) and a simplified proof of the Bruns theorem . Finally, it will be explored an…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…
We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: a new proof of a recent estimate by Drappeau and Topacogullari for arithmetical…
Let p be a prime number. The p-adic case of the Mixed Littlewood Conjecture states that liminf_{q \to \infty} q . |q|_p . ||q x|| = 0 for all real numbers x. We show that with the additional factor of log q.loglog q the statement is false.…
Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…
Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by…
The classical Artin--Whaples approximation theorem allows to simultaneously approximate finitely many different elements of a field with respect to finitely many pairwise inequivalent absolute values. Several variants and generalizations…
[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…
A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes,…
In 2005, Watanabe and Yoshida formulated a conjecture for a lower bound of the Hilbert-Kunz multiplicity of local rings that was recently settled by Meng using analytic methods. More recently, Pak-Shapiro-Smirnov-Yoshida used Ehrhart theory…
We construct new rational approximants of Euler's constant that improve those of Aptekarev et al. (2007) and Rivoal (2009). The approximants are given in terms of certain (mixed type) multiple orthogonal polynomials associated with the…
Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…
A well-known technique in estimating probabilities of rare events in general and in information theory in particular (used, e.g., in the sphere-packing bound), is that of finding a reference probability measure under which the event of…