Подписаться
Benjamin Ward
Benjamin Ward
Research Associate, La Trobe University
Подтвержден адрес электронной почты в домене latrobe.edu.au
Название
Процитировано
Процитировано
Год
A lower bound for the Hausdorff dimension of the set of weighted simultaneously approximable points over manifolds
V Beresnevich, J Levesley, B Ward
International Journal of Number Theory 17 (08), 1795-1814, 2021
82021
Simultaneous p-adic Diophantine approximation
V Beresnevich, J Levesley, B Ward
Mathematical Proceedings of the Cambridge Philosophical Society 175 (1), 13-50, 2023
62023
Bad is null
V Beresnevich, S Datta, A Ghosh, B Ward
arXiv preprint arXiv:2307.10109, 2023
52023
The dimension of the set of -badly approximable points in all ambient dimensions; on a question of Beresnevich and Velani
H Koivusalo, J Levesley, B Ward, X Zhang
arXiv preprint arXiv:2310.01947, 2023
22023
Weighted approximation for limsup sets
GG Robert, M Hussain, N Shulga, B Ward
arXiv preprint arXiv:2308.16603, 2023
22023
Weighted twisted inhomogeneous Diophantine approximation
M Hussain, B Ward
arXiv preprint arXiv:2307.13210, 2023
12023
Metrical results on the Folklore set
M Hussain, J Schleischitz, B Ward
arXiv preprint arXiv:2402.13451, 2024
2024
Liminf approximation sets for abstract rationals
M Hussain, B Ward
arXiv preprint arXiv:2309.13338, 2023
2023
Dual -adic Diophantine approximation on manifolds
M Hussain, J Schleischitz, B Ward
arXiv preprint arXiv:2308.14471, 2023
2023
Rectangular shrinking targets for actions on tori: well and badly approximable systems
V Beresnevich, S Datta, A Ghosh, B Ward
arXiv preprint arXiv:2307.10122, 2023
2023
Weighted approximation in higher-dimensional missing digit sets
D Allen, B Ward
arXiv preprint arXiv:2205.07570, 2022
2022
Counting rational points close to -adic integers and applications in Diophantine approximation
B Ward
arXiv preprint arXiv:2102.09070, 2021
2021
Weighted simultaneous Diophantine approximation in a variety of settings
B Ward
University of York, 2021
2021
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–13