Bounded-- yes, but 4?
Paul D. Humke, Cameron Marcott, Bjorn Mellem, Cole Stiegler

TL;DR
This paper reviews the problem of the perimeter-to-area ratio in unions of squares, discusses progress on Keleti's conjecture that it never exceeds 4, and provides proofs for a special case while analyzing challenges in the general case.
Contribution
It offers two proofs for a specific case of Keleti's conjecture and discusses the complexities of extending these methods to the general case.
Findings
Confirmed the ratio does not exceed 4 in a special case
Outlined current research status on Keleti's conjecture
Analyzed properties and challenges of potential counterexamples
Abstract
In this paper we will examine unions of oriented and non-oriented unit squares in same plane and measure the ratio of perimeter to area of these unions. In 1998, T. Keleti published the conjecture that this ratio never exceeds 4. We outline the current state of research on this conjecture and give two proofs of a special case. Finally, we explore the difficulties that arise from using similar methods in the general case and examine properties of any potential counterexample.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · VLSI and FPGA Design Techniques · Topology Optimization in Engineering
