Tiling-based models of perimeter and area

DOI10.1016/J.AAM.2020.102059MaRDI QIDQ2182617zbMATH OpenOpenAlexFDO

Authors Bridget Eileen Tenner

Publication date 26 May 2020

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1811.00082

zbMATH Keywords

domino tilingsElnitsky polygons

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Isoperimetric problems for polytopes (52B60) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

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.

Recommendations

• Forced perimeter in Elnitksy polygons
• Rhombic tilings of polygons and classes of reduced words in Coxeter groups
• Alternating-sign matrices and domino tilings. I
• Isoperimetric problems for tilings
• On enumeration and entropy of ribbon tilings

Cites work

• scientific article; zbMATH DE number 2133152 (Why is no real title available?)
• scientific article; zbMATH DE number 729555 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• scientific article; zbMATH DE number 2171466 (Why is no real title available?)
• A variational principle for domino tilings
• Alternating-sign matrices and domino tilings. I
• Axioms and hulls
• Combinatorics of Coxeter Groups
• Complexes of injective words and their commutation classes
• Enumerations relating braid and commutation classes
• Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3
• Higher Bruhat orders and cyclic hyperplane arrangements
• Isoperimetric pentagonal tilings
• Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.
• On commutation classes of reduced words in Weyl groups
• On dimer coverings of rectangles of fixed width
• On the expected number of commutations in reduced words
• On the number of reduced decompositions of elements of Coxeter groups
• Pattern avoidance and the Bruhat order.
• Random Walks on Infinite Graphs and Groups
• Reduced decompositions and permutation patterns
• Reduced word manipulation: patterns and enumeration
• Rhombic tilings of polygons and classes of reduced words in Coxeter groups
• Some combinatorial properties of Schubert polynomials
• The honeycomb conjecture
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Tiling parity results and the holey square solution

Cited in

(2)

• Strongly restricted permutations and tiling with fences
• Forced perimeter in Elnitksy polygons

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Tiling-based models of perimeter and area

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182617)