On a theorem of V. Bernik in the metrical theory of Diophantine approximation
classification
🧮 math.NT
math.PR
keywords
approximationbernikdiophantinemetricalproblemtheoremalanallows
read the original abstract
This paper goes back to a famous problem of Mahler in metrical Diophantine approximation. The problem has been settled by Sprindzuk and subsequently improved by Alan Baker and Vasili Bernik. In particular, Bernik's result establishes a convergence Khintchine type theorem for Diophantine approximation by polynomials, that is it allows arbitrary monotonic error of approximation. In the present paper the monotonicity assumption is completely removed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.