Division algorithm and Kronecker's approximation theorem

DOI10.1007/s41478-020-00256-8zbMath1470.11198OpenAlexW3037724028MaRDI QIDQ2026942

Jitender Singh, Gaurav Aggarwal

Publication date: 21 May 2021

Published in: The Journal of Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41478-020-00256-8

zbMATH Keywords

Diophantine approximationdivision algorithmKronecker's theoremDirichlet theorem

Mathematics Subject Classification ID

Diophantine equations in many variables (11D72) Irrationality; linear independence over a field (11J72) Approximation to algebraic numbers (11J68) Inhomogeneous linear forms (11J20)

Related Items (1)

Sumset of three arithmetic progressions in the complex plane

Cites Work

• Kronecker's approximation theorem
• Diophantine approximation
• On an effective variation of Kronecker’s approximation theorem avoiding algebraic sets
• A Note on Kronecker's Approximation Theorem
• The Best Quantitative Kronecker's Theorem
• View-Obstruction Problems and Kronecker's Theorem

This page was built for publication: Division algorithm and Kronecker's approximation theorem