Related papers: Rational approximation with chosen numerators

In this work we develop an algorithmic procedure for associating a function defined on the Riemann surface of the $\log$ to given asymptotic data from a function at an essential singularity. We do this by means of rational approximations…

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…

We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.

This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using…

Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with…

We consider a certain equidistributed sequence of rational numbers constructed from the primes. In particular, we determine the sharp convergence rate for the star discrepancy of said sequence. Our arguments are based on well-known…

We construct new rational approximants of Euler's constant that improve those of Aptekarev et al. (2007) and Rivoal (2009). The approximants are given in terms of certain (mixed type) multiple orthogonal polynomials associated with the…

We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…

Let $\alpha$ and $\beta$ be irrational real numbers and $0<\F<1/30$. We prove a precise estimate for the number of positive integers $q\leq Q$ that satisfy $\|q\alpha\|\cdot\|q\beta\|<\F$. If we choose $\F$ as a function of $Q$ we get…

We study the rational dynamics of the map $\mathcal{T}(x)=\lfloor x\rfloor(1+\{x\})$, which appears in the recursive construction of the prime-representing constant of Fridman, Garbulsky, Glecer, Grime and Florentin. For a rational number…

We consider the question of how well points in a quadric hypersurface $M\subset\mathbb R^d$ can be approximated by rational points of $\mathbb Q^d\cap M$. This contrasts with the more common setup of approximating points in a manifold by…

We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.

We give elementary proof of stronger versions of several recent results on intrinsic Diophantine approximation on rational quadric hypersurfaces $X\subset \mathbb{P}^n(\mathbb{R})$. The main tool is a refinement of the simplex lemma, which…

In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…

The Duffin--Schaeffer Conjecture answers a question on how well one can approximate irrationals by rational numbers in reduced form (an imposed condition) where the accuracy of the approximation depends on the rational number. It can be…

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…

In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…

In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…

We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.

We prove analogues of some classical results from Diophantine approximation and metric number theory (namely Dirichlet's theorem and the Duffin--Schaeffer theorem) in the setting of diagonal Diophantine approximation, i.e. approximating…