Rectangle Coincidences and Sweepouts
Richard Evan Schwartz

TL;DR
This paper establishes an integral formula for inscribed rectangles in loops and demonstrates that the count of rectangle coincidences increases linearly with the number of diameters of the polygon, under mild conditions.
Contribution
It introduces a new integral formula for continuous rectangle paths and links rectangle coincidences to polygon diameters, revealing a linear growth relationship.
Findings
Number of rectangle coincidences grows linearly with polygon diameters
Integral formula for inscribed rectangles in loops
Relationship holds under mild genericity conditions
Abstract
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally described as the number of inscribed rectangles minus the number of isometry classes of inscribed rectangles, grows linearly with the number of positively oriented extremal chords -- a.k.a. diameters -- of the polygon
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
TopicsMathematical Dynamics and Fractals · Mathematics and Applications · Advanced Differential Equations and Dynamical Systems
