English
Related papers

Related papers: Approximate expressions for mathematical constants…

200 papers

In this work, an efficient approximation scheme has been proposed for getting accurate approximate solution of nonlinear partial differential equations with constant or variable coefficients satisfying initial conditions in a series of…

Analysis of PDEs · Mathematics 2020-09-04 Prakash Kumar Das , M. M. Panja

Symbolic regression plays a crucial role in modern scientific research thanks to its capability of discovering concise and interpretable mathematical expressions from data. A key challenge lies in the search for parsimonious and…

Machine Learning · Computer Science 2025-09-12 Kai Ruan , Yilong Xu , Ze-Feng Gao , Yike Guo , Hao Sun , Ji-Rong Wen , Yang Liu

In this paper we present a novel non-parametric method of simplifying piecewise linear curves and we apply this method as a statistical approximation of structure within sequential data in the plane. We consider the problem of minimizing…

Computational Geometry · Computer Science 2012-05-31 Stephane Durocher , Alexandre Leblanc , Jason Morrison , Matthew Skala

In a spirit of Ap\'ery's proof of the irrationality of $\zeta(3)$, we construct a sequence $p_n/q_n$ of rational approximations to the $2$-adic zeta value $\zeta_2(5)$ which satisfy $0 < |\zeta_2(5)-p_n/q_n|_2 <…

Number Theory · Mathematics 2026-05-28 Li Lai , Johannes Sprang , Wadim Zudilin

This paper presents a complete formal verification of a proof that the evaluation of the Riemann zeta function at 3 is irrational, using the Coq proof assistant. This result was first presented by Ap\'ery in 1978, and the proof we have…

Logic in Computer Science · Computer Science 2023-06-22 Assia Mahboubi , Thomas Sibut-Pinote

We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…

Computational Geometry · Computer Science 2014-10-09 Sharareh Alipour , Bahman Kalantari , Hamid Homapour

We provide rapidly converging formulae for the Riemann zeta function at odd integers using the Lambert series $\mathscr{L}_q(s) = \sum_{n=1}^\infty n^{s} q^{n}/(1-q^n)$, $s=-(4k\pm 1)$. Our main formula for $\zeta(4k-1)$ converges at rate…

Number Theory · Mathematics 2018-03-12 Shubho Banerjee , Blake Wilkerson

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…

Econometrics · Economics 2021-10-07 Nick Huntington-Klein

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

Algebraic Geometry · Mathematics 2019-01-09 Robert Granger

We construct a class of $\mathbb{Z}_2\mathbb{Z}_4$-additive cyclic codes generated by pairs of polynomials, study their algebraic structures, and obtain the generator matrix of any code in the class. Using a probabilistic method, we prove…

Information Theory · Computer Science 2019-11-22 Yun Fan , Hualu Liu

In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…

Optimization and Control · Mathematics 2024-12-26 Hong Zhu

In a recent study of the quantum theory of harmonic oscillators, Gerard 't Hooft proposed the following problem: given $G(z)=\sum_{n=1}^\infty\sqrt{n}\,z^n$ for $|z|<1$, find its analytic continuation for $|z|\ge1$, excluding a branch-cut…

Number Theory · Mathematics 2025-10-14 David Broadhurst , Gergő Nemes

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

Classical Analysis and ODEs · Mathematics 2020-01-01 R. M. Trigub

The best pair problem aims to find a pair of points that minimize the distance between two disjoint sets. In this paper, we formulate the classical robust principal component analysis (RPCA) as the best pair; which was not considered…

Optimization and Control · Mathematics 2020-12-02 Aritra Dutta , Filip Hanzely , Jingwei Liang , Peter Richtárik

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…

Numerical Analysis · Mathematics 2008-05-21 James Demmel , Ioana Dumitriu , Olga Holtz , Plamen Koev

In this paper we study the fine-grained complexity of finding exact and approximate solutions to problems in P. Our main contribution is showing reductions from exact to approximate solution for a host of such problems. As one (notable)…

Computational Complexity · Computer Science 2022-12-12 Lijie Chen , Shafi Goldwasser , Kaifeng Lyu , Guy N. Rothblum , Aviad Rubinstein

This note proves that the first odd zeta value does not have a closed form formula $\zeta(3)\ne r \pi^3$ for any rational number $r \in \mathbb{Q}$. Furthermore, assuming the irrationality of the second odd zeta value $\zeta(5)$, it is…

General Mathematics · Mathematics 2019-07-30 N. A. Carella

We study the basic computational problem of detecting approximate stationary points for continuous piecewise affine (PA) functions. Our contributions span multiple aspects, including complexity, regularity, and algorithms. Specifically, we…

Optimization and Control · Mathematics 2025-01-07 Lai Tian , Anthony Man-Cho So

Linear recurrence equations with constant coefficients define the power series coefficients of rational functions. However, one usually prefers to have an explicit formula for the sequence of coefficients, provided that such a formula is…

Symbolic Computation · Computer Science 2022-07-05 Bertrand Teguia Tabuguia , Wolfram Koepf

We develop ladders that reduce $\zeta(n):=\sum_{k>0}k^{-n}$, for $n=3,5,7,9,11$, and $\beta(n):=\sum_{k\ge0}(-1)^k(2k+1)^{-n}$, for $n=2,4,6$, to convergent polylogarithms and products of powers of $\pi$ and $\log2$. Rapid computability…

Classical Analysis and ODEs · Mathematics 2025-10-20 D. J. Broadhurst
‹ Prev 1 4 5 6 7 8 10 Next ›