Generalized lattice-point visibility in N^k

From MaRDI portal
Publication:2037252



Abstract: It is a well-known result that the proportion of lattice points visible from the origin is given by frac1zeta(2), where zeta(s)=sumn=1inftyfrac1ns denotes the Riemann zeta function. Goins, Harris, Kubik and Mbirika, generalized the notion of lattice point visibility by saying that for a fixed binmathbbN, a lattice point (r,s)inmathbbN2 is b-visible from the origin if no other lattice point lies on the graph of a function f(x)=mxb, for some minmathbbQ, between the origin and (r,s). In their analysis they establish that for a fixed binmathbbN, the proportion of b-visible lattice points is frac1zeta(b+1), which generalizes the result in the classical lattice point visibility setting. In this short note we give an n-dimensional notion of -visibility that recovers the one presented by Goins et. al. in 2-dimensions, and the classical notion in n-dimensions. We prove that for a fixed the proportion of -visible lattice points is given by frac1zeta(sumi=1nbi). Moreover, we propose a -visibility notion for vectors , and we show that by imposing weak conditions on those vectors one obtains that the density of -visible points is frac1zeta(sumi=1nbi). Finally, we give a notion of visibility for vectors , compatible with the previous notion, that recovers the results of Harris and Omar for binmathbbQ∗ in 2-dimensions; and show that the proportion of -visible points in this case only depends on the negative entries of .












This page was built for publication: Generalized lattice-point visibility in \(\mathbb{N}^k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037252)