Related papers: Approximation Of Logarithm, Factorial And Euler Ma…
This paper naturally extends and generalizes our previous work "Thue-Morse constant is not badly approximable", arXiv:1407.3182 [math.NT]. Here we consider the Laurent series $f_d(x) = \prod_{n=0}^\infty (1 - x^{-d^n})$, $d\in\mathbb{N}$,…
We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of $n$ positive semidefinite $n \times n$ matrices within a factor $2^{O(n)}$. Consequently, the algorithm allows us to approximate in randomized…
The main goal of this paper is to analyze a family of "simplest possible" initial data for which, as shown by numerical simulations, the incompressible Euler equations have multiple solutions. We take here a first step toward a rigorous…
The standard approximation of a natural logarithm in statistical analysis interprets a linear change of \(p\) in \(\ln(X)\) as a \((1+p)\) proportional change in \(X\), which is only accurate for small values of \(p\). I suggest…
For each positive integer $m$, the $m$th order harmonic numbers are given by $$H_n^{(m)}=\sum_{0<k\le n}\frac1{k^m}\ \ (n=0,1,2,\ldots).$$ We discover exact values of some series involving harmonic numbers of order not exceeding four. For…
The sequence of 1/2-discrepancy sums of $\{x + i \theta \bmod 1\}$ is realized through a sequence of substitutions on an alphabet of three symbols; particular attention is paid to $x=0$. The first application is to show that any asymptotic…
A landmark result from rational approximation theory states that $x^{1/p}$ on $[0,1]$ can be approximated by a type-$(n,n)$ rational function with root-exponential accuracy. Motivated by the recursive optimality property of Zolotarev…
We shall consider some special generalizations of Euler's factorial series. First we construct Pad\'e approximations of the second kind for these series. Then these approximations are applied to study global relations of certain p-adic…
An extension of the theory of the Iterated Logarithmic Algebra gives the logarithmic analog of a Sheffer or Appell sequence of polynomials. This leads to several examples including Stirling's formula and a logarithmic version of the…
In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch. We describe two different approximation algorithms for the Max-Morse Matching Problem. For…
We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\mathbb{Q}^d$ can be approximated with a factor of $O(\log d)^{d/2}$ in polynomial time. This improves upon the previously best known…
The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of…
We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.
For real numbers $p,q>1$ we consider the following family of integrals: \begin{equation*} \int_{0}^{1}\frac{(x^{q-2}+1)\log\left(x^{mq}+1\right)}{x^q+1}{\rm d}x \quad \mbox{and}\quad…
In even-dimensional Euclidean space for integer powers of the Laplacian greater than or equal to the dimension divided by two, a fundamental solution for the polyharmonic equation has logarithmic behavior. We give two approaches for…
We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are…
A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…
An algorithm of searching a zero of an unknown undimensional function is considered, measured at a point x with some error. The step sizes are random positive values and are calculated according to the rule: if two consecutive iterations…
We construct a class of multiple Legendre polynomials and prove that they satisfy an Ap\'ery-like recurrence. We give new upper bounds of the approximation measures of logarithms of rational numbers by algebraic numbers of bounded degree.…
We investigate a recursively generated sequence of random variables that begins with an Exponential random variable with parameter (i.e., inverse-mean) 1, and continues with additional Exponentials, each of whose random parameter possesses…