中文
相关论文

相关论文: Approximating reals by sums of rationals

200 篇论文

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

数论 · 数学 2026-04-03 Stephan Baier , Habibur Rahaman

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

综合数学 · 数学 2008-06-30 Dimitris Sardelis

We discuss how to write down three specific natural numbers $A$, $B$, $C$ such that for any real number $r$ you've probably ever thought of, it is consistent with $\mathsf{ZFC}$ set theory that $$\def\Rb{\mathbb{R}}\def\Nb{\mathbb{N}}r =…

逻辑 · 数学 2026-02-03 James E. Hanson , Connor Watson

The AAA algorithm for rational approximation is employed to illustrate applications of rational functions all across numerical analysis.

数值分析 · 数学 2025-10-21 Yuji Nakatsukasa , Lloyd N. Trefethen

A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…

数据分析、统计与概率 · 物理学 2007-05-23 Bernhard Kaufmann

We find the closest approximation to 1 from below using a sum of $n$ Egyptian fractions.

经典分析与常微分方程 · 数学 2007-05-23 K. Soundararajan

We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…

数据结构与算法 · 计算机科学 2012-03-01 Bin Fu , Wenfeng Li , Zhiyong Peng

We consider the problem of simultaneous approximation to a number and to its square in a general framework that encompasses imaginary quadratic number fields and fields of rational functions in one variable. In this context, we construct…

数论 · 数学 2022-02-02 Samuel Pilon , Damien Roy

We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree of each term should be small (up to 10), and the number of…

最优化与控制 · 数学 2011-02-25 Florian Bugarin , Didier Henrion , Jean-Bernard Lasserre

The continued fraction expansion of an irrational number $\alpha$ is eventually periodic if and only if $\alpha$ is a quadratic irrationality. However, very little is known regarding the size of the partial quotients of algebraic real…

数论 · 数学 2012-05-07 Boris Adamczewski , Yann Bugeaud

We show how rational function approximations to the logarithm, such as $\log z \approx (z^2 - 1)/(z^2 + 6z + 1)$, can be turned into fast algorithms for approximating the determinant of a very large matrix. We empirically demonstrate that…

数据结构与算法 · 计算机科学 2024-05-07 Thomas Colthurst , Srinivas Vasudevan , James Lottes , Brian Patton

A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…

统计力学 · 物理学 2009-11-10 V. I. Yukalov , S. Gluzman , D. Sornette

The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…

历史与综述 · 数学 2017-02-28 Tanay Wakhare

We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally…

代数几何 · 数学 2013-06-17 Claus Scheiderer

For a positive integer $n$, we denote by $F(n)$ the distance from $n$ to the nearest prime number. We prove that every sufficiently large positive integer $N$ can be represented as the sum $N=n_1+n_2$, where $$ F(n_i) \geqslant (\log…

数论 · 数学 2022-09-08 Mikhail R. Gabdullin

We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a…

经典分析与常微分方程 · 数学 2008-09-16 Shahaf Nitzan-Hahamov , Alexander Olevskii

Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…

符号计算 · 计算机科学 2017-06-29 Shaoshi Chen

Let $s_q(n)$ denote the sum of the digits of a number $n$ expressed in base $q$. We study here the ratio $\frac{s_q(n^\alpha)}{s_q(n)}$ for various values of $q$ and $\alpha$. In 1978, Kenneth B. Stolarsky showed that…

数论 · 数学 2014-08-04 John Charles Saunders

We look at a class of transcendental real numbers xi which, together with their square, satisfy some extremal property of simultaneous approximation by rational numbers with the same denominator. We give a sufficient condition for such a…

数论 · 数学 2013-01-07 Damien Roy

We prove decidability of univariate real algebra extended with predicates for rational and integer powers, i.e., $(x^n \in \mathbb{Q})$ and $(x^n \in \mathbb{Z})$. Our decision procedure combines computation over real algebraic cells with…

逻辑 · 数学 2015-06-17 Grant Olney Passmore