The distribution of the generalized greatest common divisor and visibility of lattice points

preprint2020arXivOpen access

Abstract

For a fixed b∈N={1,2,3,… }b\in \mathbb{N}=\{1,2,3,\dots\}, Goins et al. \cite{Harris} defined the concept of bb-visibility for a lattice point (r,s)(r,s) in L=N×NL=\mathbb{N}\times \mathbb{N} which states that (r,s)(r,s) is bb-visible from the origin if it lies on the graph of f(x)=axbf(x)=ax^b, for some positive a∈Qa\in \mathbb{Q}, and no other lattice point in LL lies on this graph between (0,0)(0,0) and (r,s)(r,s). Furthermore, to study the density of bb-visible points in LL Goins et al. defined a generalization of greatest common divisor, denoted by gcd⁡b\gcd_b, and proved that the proportion of bb-visible lattice points in LL is given by 1/ζ(b+1)1/ζ(b+1), where ζ(s)ζ(s) is the Riemann zeta function. In this paper we study the mean values of arithmetic functions Λ:L→CΛ:L\to \mathbb{ C} defined using gcd⁡b\gcd_b and recover the main result of \cite{Harris} as a consequence of the more general results of this paper. We also investigate a generalization of a result in \cite{Harris} that asserts that there are arbitrarily large rectangular arrangements of bb-visible points in the lattice LL for a fixed bb, more specifically, we give necessary and sufficient conditions for an arbitrary rectangular arrangement containing bb-visible and bb-invisible points to be realizable in the lattice LL. Our result is inspired by the work of Herzog and Stewart \cite{Herzog} who proved this in the case b=1b=1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.