中文
相关论文

相关论文: Best rational approximations of an irrational numb…

200 篇论文

We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…

数论 · 数学 2025-11-21 Manuel Hauke , Emmanuel Kowalski

We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…

数论 · 数学 2007-05-23 Iskander Aliev , Martin Henk

This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…

数论 · 数学 2019-05-15 Nickolas Andersen , William Duke

Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…

动力系统 · 数学 2024-12-09 Niels Langeveld , David Ralston

We introduce and investigate a new notion of the theory of approximation-the so-called degenerate approximation, i.e. approximation of the function of two (and more) variables (kernel) by means of degenerate function (kernel). We apply…

概率论 · 数学 2013-03-14 E. Ostrovsky , L. Sirota

In math.NT/0307308 we defined the irrationality base of an irrational number and, assuming a stronger hypothesis than the irrationality of Euler's constant, gave a conditional upper bound on its irrationality base. Here we develop the…

数论 · 数学 2007-05-23 Jonathan Sondow

Motivated by the optimal continued fractions studied independently by Selenius and Bosma, we define and introduce algorithms producing superoptimal continued fraction expansions of irrationals. The convergents of these expansions…

数论 · 数学 2025-12-09 Slade Sanderson

Bayesian inference has theoretical attractions as a principled framework for reasoning about beliefs. However, the motivations of Bayesian inference which claim it to be the only 'rational' kind of reasoning do not apply in practice. They…

机器学习 · 统计学 2022-11-14 Sebastian Farquhar

The nearest integer continued fraction of a real number $x$ from $[-1/2, 1/2)$ is defined. Some metrical properties of these expansions are presented. We define the approximation coefficients and give an important result on them. The main…

数论 · 数学 2011-06-22 Dan Lascu , George Cirlig , Ion Coltescu

The minimization principle $\textsf{MIN}(\triangleleft)$ studied in bounded arithmetic says that a strict linear ordering $\triangleleft$ on any finite interval $[0,\dots,n)$ has the minimal element. We shall prove that bounded arithmetic…

逻辑 · 数学 2026-05-18 Mykyta Narusevych

The Rosen fractions are an infinite set of continued fraction algorithms, each giving expansions of real numbers in terms of certain algebraic integers. For each, we give a best possible upper bound for the minimum in appropriate…

数论 · 数学 2007-08-27 Cor Kraaikamp , Thomas A. Schmidt , Ionica Smeets

We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…

符号计算 · 计算机科学 2010-01-06 Xiaolin Qin , Yong Feng , Jingwei Chen , Jingzhong Zhang

We recall the notion of nearest integer continued fractions over the Euclidean imaginary quadratic fields $K$ and characterize the "badly approximable" numbers, ($z$ such that there is a $C(z)>0$ with $|z-p/q|\geq C/|q|^2$ for all $p/q\in…

数论 · 数学 2018-09-21 Robert Hines

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

逻辑 · 数学 2026-02-11 Peter Hertling , Rupert Hölzl , Philip Janicki

The goal of this paper is to derive a simple recursion that generates a sequence of fractions approximating $\sqrt[n]{k}$ with increasing accuracy. The recursion is defined in terms of a series of first-order non-linear difference equations…

动力系统 · 数学 2011-11-15 Joe Nance

The pigeonhole principle states that if $n$ items are contained in $m$ boxes, then at least one box has no more than $n / m$ items. It is utilized to solve many data management problems, especially for thresholded similarity searches.…

数据库 · 计算机科学 2020-02-14 Jianbin Qin , Chuan Xiao

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

复变函数 · 数学 2017-09-26 Simon St-Amant , Jérémie Turcotte

$p$-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of $p$-adic numbers, offering a novel perspective on number representation and approximation. While numerous $p$-adic…

数论 · 数学 2024-03-05 Zhaonan Wang , Yingpu Deng

In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…

混沌动力学 · 物理学 2014-08-20 Marius-F. Danca

We relate a previous result of ours on families of Diophantine equations having only trivial solutions with a result on the approximation of an algebraic number by products of rational numbers and units. We compare this approximation with a…

数论 · 数学 2013-12-30 Claude Levesque , Michel Waldschmidt