On the error bounds for visible points in some cut-and-project sets
Dynamical Systems
2025-05-06 v1 Number Theory
Abstract
We study points in cut-and-project sets which are visible from the origin, continuing a direction of inquiry initiated in [6,14] where the asymptotic density of visible points was investigated. We establish an error bound for the density of visible points in certain cases. We also prove that the set of visible points in irreducible cut-and-project sets with star-shaped windows is never relatively dense.
Cite
@article{arxiv.2505.02631,
title = {On the error bounds for visible points in some cut-and-project sets},
author = {Ilya Gringlaz and Rishi Kumar and Barak Weiss},
journal= {arXiv preprint arXiv:2505.02631},
year = {2025}
}