• Fair Partitions of Polygons: An Elementary Introduction

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Convex polygons; fair partition.

    • Abstract


      We introduce the question: Given a positive integer 𝑁, can any 2D convex polygonal region be partitioned into 𝑁 convex pieces such that all pieces have the same area and the same perimeter? The answer to this question is easily `yes’ for $N=2$. We give an elementary proof that the answer is `yes’ for $N=4$ and generalize it to higher powers of 2.

    • Author Affiliations


      R Nandakumar1 N Ramana Rao2

      1. ‘Kovilet’, Palace 41 Compound, Tripunithura 682 301, India
      2. B-206, Maha Lakshmi Estates, Prashanthi Nagar, Nizampet Road, Hyder Nagar, Hyderabad 500 085, India
    • Dates

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2017-2019 Indian Academy of Sciences, Bengaluru.