Decompositions of a polygon into centrally symmetric pieces
Abstract
In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex (2k)-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of k, and characterize them for octagons.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.