'Fair' Partitions of Polygons - an Introduction

Date
Authors
Nandakumar, R.
Rao, N. Ramana
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
We address the question: Given a positive integer $N$, can any 2D convex polygonal region be partitioned into $N$ convex pieces such that all pieces have the same area and same perimeter? The answer to this question is easily `yes' for $N$=2. We prove the answer to be `yes' for $N$=4 and also discuss higher powers of 2.
Comment: 7 pages. 1 figure. This version (v6) is mostly a formal reworking of the main proof in v2 which was uploaded in December 2008
Keywords
Mathematics - Combinatorics, Mathematics - History and Overview
Citation
Collections