Abstract
We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values for perimeter tiles in convex centrally symmetric 2n-gons. These bounds and values have implications for the combinatorics of reduced decompositions of permutations. We also classify the permutations whose polygons gave minimal perimeter, defined in two different ways. We conclude by looking at some of these questions in the context of domino tilings, giving a recursive formula and generating function for one family, and describing a family of minimal-perimeter regions.
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 callDisclaimer: 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.
