Squaring and not squaring one or more planes
Online Journal of Analytic Combinatorics · 2015
DOI: 10.61091/ojac-1006 ↗Kurz gefasst
Fachartikel in der Zeitschrift Online Journal of Analytic Combinatorics, 2015. Verfasst von Frederick V. Henle und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
A set of natural numbers tiles the plane if a square-tiling of the plane exists using exactly one square of side length n for every n in the set. In [9] it is shown that N, the set of all natural numbers, tiles the plane. We answer here a number of questions from that paper. We show that there is a simple tiling of the plane (no nontrivial subset of squares forms a rectangle). We show that neither the odd numbers nor the prime numbers tile the plane. We show that N can tile many, even infinitely many planes.
Zitieren
APA
Henle, F. V., & Henle, J. M. (2015). Squaring and not squaring one or more planes. Online Journal of Analytic Combinatorics. https://doi.org/10.61091/ojac-1006
Vancouver
Henle FV, Henle JM. Squaring and not squaring one or more planes. Online Journal of Analytic Combinatorics. 2015. doi:10.61091/ojac-1006
BibTeX
@article{Henle2015,
author = {Henle, Frederick V. and Henle, James M.},
title = {Squaring and not squaring one or more planes},
journal = {Online Journal of Analytic Combinatorics},
year = {2015},
doi = {10.61091/ojac-1006}
}
EUVIMED