Density of large holes among power-free lattice points
Francesco Cellarosi
Source abstract
For fixed integers with , the -free points of are the vectors whose coordinate gcd is not divisible by the th power of any prime. We consider the set of non--free points in as the vertex set of a graph with nearest-neighbour adjacency. For , we say that a point is -deep if . Thus -deep points are the lattice centres of closed -balls whose lattice points are all non--free. We call a connected component -large if it contains an -deep point. We mark each finite -large component by selecting its lexicographically least -deep point as its representative. Uniformly for , we show that the density of -deep points and the density of these representatives both equal as , where denotes the volume of the unit ball in . For deep points, this sharpens the positive-density hole constructions of Baake, Moody, and Pleasants and of Pleasants and Huck, and the latter authors' upper bounds for sparse-pattern frequencies. When , we show that the density of -free integers followed by exactly non--free integers and then another -free integer is as , improving the asymptotic which follows from Grimmett's work. % For fixed , we also obtain estimates uniform in growing dimensions .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.