Vol. 14, No. 2, 2021

Download this article
Download this article For screen
For printing
Recent Issues

Volume 14
Issue 4, 541–721
Issue 3, 361–540
Issue 2, 181–360
Issue 1, 1–179

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editors’ Interests
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Author Index
Coming Soon
 
Other MSP Journals
This article is available for purchase or by subscription. See below.
New methods to find patches of invisible integer lattice points

Austin Goodrich, aBa Mbirika and Jasmine Nielsen

Vol. 14 (2021), No. 2, 283–310
Abstract

It is a surprising fact that the proportion of integer lattice points visible from the origin is exactly 6π2, or approximately 60%. Hence, approximately 40% of the integer lattice is hidden from the origin. Since 1971, many have studied a variety of problems involving lattice-point visibility, in particular, searching for patterns in that 40% of the lattice composed of invisible points. One such pattern is a square patch, an n×n grid of n2 invisible points, which we call a hidden forest. It is known that there exist arbitrarily large hidden forests in the integer lattice. However, the methods up to now involve the Chinese remainder theorem (CRT) on the rows and columns of matrices with prime number entries, and they have only been able to locate hidden forests very far from the origin. For example, using this method the closest known 4×4 hidden forest is over 3 quintillion, or 3×1018 , units away from the origin. We introduce the concept of quasiprime matrices and utilize a variety of computational and theoretical techniques to find some of the closest known hidden forests to date. Using these new techniques, we find a 4×4 hidden forest that is merely 184 million units away from the origin. We conjecture that every hidden forest can be found via the CRT-algorithm on a quasiprime matrix.

PDF Access Denied

However, your active subscription may be available on Project Euclid at
https://projecteuclid.org/involve

We have not been able to recognize your IP address 54.227.97.219 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 30.00:

Keywords
lattice-point visibility, Chinese remainder theorem, number theory
Mathematical Subject Classification
Primary: 11P21
Secondary: 11Y99
Supplementary material

Java Code

Milestones
Received: 27 July 2020
Revised: 14 November 2020
Accepted: 14 November 2020
Published: 6 April 2021

Communicated by Stephan Garcia
Authors
Austin Goodrich
University of Wisconsin
Eau Claire, WI
United States
aBa Mbirika
Department of Mathematics
University of Wisconsin
Eau Claire, WI
United States
Jasmine Nielsen
University of Wisconsin
Eau Claire, WI
United States