Abstract

The problem relating to the polyace is the reciprocal of that relating to the polygon, and is not separately discussed. By the k -partitions of a polygon, the author means the number ®f ways in which the polygon can be divided by ( k -1) diagonals, no one of which crosses another; two ways being different only when no cyclical permutation or reversion of the numbers at the angles of the polygon can make them alike: it is assumed that the polygon is of the ordinary convex form, so that all the diagonals lie within its area.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.