Related papers: Effective method of computing Li's coefficients an…

This paper provides some statistics for the coefficients of Russell- Type modular equations for the modular function, {\lambda}({\tau}). The results hold uniformly for all odd primes. They do not rely on any numerical evaluations of…

We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…

In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…

We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…

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…

It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…

This paper proposes a new Bayesian approach to estimate the Gini coefficient from the Lorenz curve based on grouped data. The proposed approach assumes a hypothetical income distribution and estimates the parameter by directly working on…

In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe^{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev…

The Keiper/Li constants $\{\lambda_n\}_{n=1,2,\ldots}$ are asymptotically ($n \to \infty$) sensitive to the Riemann Hypothesis, but highly elusive analytically and difficult to compute numerically. We present quite explicit variant…

This thesis is devoted to studying estimates of the least common multiple of some integer sequences. Our study focuses on effective bounding of the $\mathrm{lcm}$ of some class of quadratic sequences, as well as arithmetic progressions and…

The problem of effective equations is reviewed and discussed. Starting from the classical Langevin equation, we show how it can be generalized to Hamiltonian systems with non-standard kinetic terms. A numerical method for inferring…

In this work, we develop a new iterative method for computing the digits of $\pi$ by argument reduction of the tangent function. This method combines a modified version of the iterative formula for $\pi$ with squared convergence that we…

An efficient procedure for the computation of the coefficients of Legendre expansions is here presented. We prove that the Legendre coefficients associated with a function f(x) can be represented as the Fourier coefficients of an Abel-type…

We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end.…

Let $F$ be a function in the Selberg class ${\mathcal S}$ and $a$ be a real number not equal to 1/2. Consider the sum $$\lambda_{F}(n,a)=\sum_{\rho}\left[1-\left(\frac{\rho-a}{\rho+a-1}\right)^{n}\right],$$ where $\rho$ runs over the…

The algebraic structure of iterated integrals has been encoded by Chen. Formally, it identifies with the shuffle and Lie calculus of Lyndon, Ree and Sch\"utzenberger. It is mostly incorporated in the modern theory of free Lie algebras.…

We propose a class of robust estimates for multivariate linear models. Based on the approach of MM estimation (Yohai 1987), we estimate the regression coefficients and the covariance matrix of the errors simultaneously. These estimates have…

The main goal of this paper is to define and study new methods for the computation of effective coefficients in the homogenization of divergence-form operators with random coefficients. The methods introduced here are proved to have optimal…

We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…

The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…