Odd Coverings of Two Infinite Rows of Squares by Horizontal Translates
The PUMP Journal of Undergraduate Research · 22.06.2026 · 9 · 212-222
DOI: 10.46787/pump.v9i.3865 ↗Kurz gefasst
Fachartikel in der Zeitschrift The PUMP Journal of Undergraduate Research, online erschienen am 22.06.2026. Verfasst von Rom Pinchasi und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
We consider two bi-infinite horizontal rows L0 and L1 of consecutive grid squares in the plane. We are given a shape T in the plane that is composed of m consecutive grid squares in L0 and n consecutive grid squares in L1. We would like to find an infinite subset D of integers such that the density of those grid squares in L0 union L1 that belong to an odd number of the sets in the family of integer horizontal translates T+x, where x is in D, is maximum. We denote by g(m,n) this maximum density of grid squares that we can cover an odd number of times by integer horizontal translates of T. We completely resolve this problem and find precisely the value of g(m,n) for every two natural numbers m and n. We also resolve the continuous version of this problem and suggest several open problems for further study.
Zitieren
APA
Pinchasi, R., & Weissbaum, Z. (2026). Odd Coverings of Two Infinite Rows of Squares by Horizontal Translates. The PUMP Journal of Undergraduate Research, 9, 212-222. https://doi.org/10.46787/pump.v9i.3865
Vancouver
Pinchasi R, Weissbaum Z. Odd Coverings of Two Infinite Rows of Squares by Horizontal Translates. The PUMP Journal of Undergraduate Research. 2026;9:212-222. doi:10.46787/pump.v9i.3865
BibTeX
@article{Pinchasi2026,
author = {Pinchasi, Rom and Weissbaum, Zoe},
title = {Odd Coverings of Two Infinite Rows of Squares by Horizontal Translates},
journal = {The PUMP Journal of Undergraduate Research},
year = {2026},
volume = {9},
pages = {212--222},
doi = {10.46787/pump.v9i.3865}
}
EUVIMED