Results 1 to 10 of about 3,571 (122)
Unconventional height functions in simultaneous Diophantine approximation. [PDF]
Simultaneous Diophantine approximation is concerned with the approximation of a point $\mathbf x\in\mathbb R^d$ by points $\mathbf r\in\mathbb Q^d$, with a view towards jointly minimizing the quantities $\|\mathbf x - \mathbf r\|$ and $H(\mathbf r ...
Fishman L, Simmons D.
europepmc +10 more sources
Restricted simultaneous Diophantine approximation [PDF]
We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.Comment: 16 pages.
Baier, Stephan, Ghosh, Anish
core +3 more sources
A simultaneous Diophantine approximation (SDA) algorithm takes instances of the partial approximate common divisor (PACD) problem as input and outputs a solution.
Wonhee Cho, Jiseung Kim, Changmin Lee
doaj +2 more sources
Successive Minima and Best Simultaneous Diophantine Approximations [PDF]
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.
Aliev, Iskander, Henk, Martin
core +2 more sources
On the Littlewood conjecture in simultaneous Diophantine approximation [PDF]
For any given real number $\alpha$ with bounded partial quotients, we construct explicitly continuum many real numbers $\beta$ with bounded partial quotients for which the pair $(\alpha, \beta)$ satisfies a strong form of the Littlewood conjecture.
Adamczewski, Boris, Bugeaud, Yann
core +5 more sources
Simultaneous p-adic Diophantine approximation [PDF]
AbstractThe aim of this paper is to develop the theory of weighted Diophantine approximation of rational numbers to p-adic numbers. Firstly, we establish complete analogues of Khintchine’s theorem, the Duffin–Schaeffer theorem and the Jarník–Besicovitch theorem for ‘weighted’ simultaneous Diophantine approximation in the p-adic case.
Beresnevich, Victor +2 more
openaire +3 more sources
The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a lattice self ...
Michel L. Lapidus +2 more
doaj +1 more source
The modulus of type N=p2q is often used in many variants of factoring-based cryptosystems due to its ability to fasten the decryption process. Faster decryption is suitable for securing small devices in the Internet of Things (IoT) environment or ...
Muhammad Asyraf Asbullah +3 more
doaj +1 more source
Witnessing a Poincaré recurrence with Mathematica
The often elusive Poincaré recurrence can be witnessed in a completely integrable system. For such systems, the problem of recurrence reduces to the classic mathematical problem of simultaneous Diophantine approximation of multiple numbers.
J.M. Zhang, Y. Liu
doaj +1 more source
Best Simultaneous Diophantine Approximations under a Constraint on the Denominator [PDF]
We investigate the problem of best simultaneous Diophantine approximation under a constraint on the denominator, as proposed by Jurkat. New lower estimates for optimal approximation constants are given in terms of critical determinants of suitable star ...
Aliev, Iskander, Gruber, Peter
core +5 more sources

