Abstract
We study tiling-based perimeter and characterize when a given perimeter tile appears in all rhombic tilings of an Elnitsky polygon. Regardless of where on the perimeter this tile appears, its forcing can be described in terms of 321-patterns. We characterize the permutations with maximally many forced right-perimeter tiles, and show that they are enumerated by the Catalan numbers.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.