Related papers: Approximating Mathematical Constants using Minecra…
We develop approximate estimation methods for exponential random graph models (ERGMs), whose likelihood is proportional to an intractable normalizing constant. The usual approach approximates this constant with Monte Carlo simulations,…
The paper proposes an approximate expression for calculating very complex one-dimensional integrals depending on the parameter $a$. These integrals often occur in computational problems theory of magnetic solitons. The resulting analytical…
Poincar{\'e} inequalities are ubiquitous in probability and analysis and have various applications in statistics (concentration of measure, rate of convergence of Markov chains). The Poincar{\'e} constant, for which the inequality is tight,…
The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives an approximation algorithm with…
In this paper, we continue to study properties of rational approximations to Euler's constant and values of the Gamma function defined by linear recurrences, which were found recently by A. I. Aptekarev and T. Rivoal. Using multiple…
We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…
There is little known about the methods used by the ancient Babylonians and Egyptians to arrive at their recorded estimates of the value of Pi. A surprisingly accurate estimate of Pi was recently revealed coded within a verse in the book of…
Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number $k$ that satisfies $ a^3+b^3+c^3+…
We present a simple recurrent formula to generate the Machin-like expression for calculating $\pi/4$. The method works for any denominator in the starting term and always provides a finite decomposition. We show that the terms in the…
We obtain two sequences of rational numbers which converge to the Euler-Gompertz constant. Denote by <f(x)> the integral of f(x)e^{-x} from 0 to infinity. Recall that the Euler-Gompertz constant \delta is <ln(x+1)>. Main idea. Let P_n(x) be…
Data-sensitive metrics adapt distances locally based the density of data points with the goal of aligning distances and some notion of similarity. In this paper, we give the first exact algorithm for computing a data-sensitive metric called…
In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…
We investigate numerically the optimal constants in Lieb-Thirring inequalities by studying the associated maximization problem. We use a monotonic fixed-point algorithm and a finite element discretization to obtain trial potentials which…
An $\epsilon$-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most $\epsilon$ from each other. Given a set of points and a set of objects,…
In this paper we consider how to use the convolution method to construct approximations, which consist of fuzzy numbers sequences with good properties, for a general fuzzy number. It shows that this convolution method can generate…
We look at approximations $ \zeta_X $ of the $\zeta$-function introduced in Gonek's paper (arXiv:0704.3448). We look at how close the approximate zeroes are to the actual zeroes when (i) X is fixed (Section 1)(ii) X varies like $ t/2\pi $…
In this work, the uncertainties in the dielectric constants of polar liquids, computed using molecular dynamics (MD) simulations, are compared for two different calculations schemes. Expressions of the uncertainty are derived for the…
This paper studies two structured approximation problems: (1) Recovering a corrupted low-rank Toeplitz matrix and (2) recovering the range of a Fourier matrix from a single observation. Both problems are computationally challenging because…
The knowledge of the orbit or the ephemeris uncertainty of asteroid presents a particular interest for various purposes. These quantities are for instance useful for recovering asteroids, for identifying lost asteroids or for planning…
The Median String Problem is W[1]-Hard under the Levenshtein distance, thus, approximation heuristics are used. Perturbation-based heuristics have been proved to be very competitive as regards the ratio approximation accuracy/convergence…