Ribbon Tile Invariants
نویسنده
چکیده
Let T be a finite set of tiles, and B a set of regions Γ tileable by T. We introduce a tile counting group G(T,B) as a group of all linear relations for the number of times each tile τ ∈ T can occur in a tiling of a region Γ ∈ B. We compute the tile counting group for a large set of ribbon tiles, also known as rim hooks, in a context of representation theory of the symmetric group. The tile counting group is presented by its set of generators, which consists of certain new tile invariants. In a special case these invariants generalize the Conway-Lagarias invariant for tromino tilings and a height invariant which is related to computation of characters of the symmetric group. The heart of the proof is the known bijection between rim hook tableaux and certain standard skew Young tableaux. We also discuss signed tilings by the ribbon tiles and apply our results to the tileability problem.
منابع مشابه
Ribbon Tile Invariants from Signed Area
Ribbon tiles are polyominoes consisting of n squares laid out in a path, each step of which goes north or east. Tile invariants were rst introduced in P1], where a full basis of invariants of ribbon tiles was conjectured. Here we present a complete proof of the conjecture, which works by associating ribbon tiles with certain polygons in the complex plane, and deriving invariants from the signed...
متن کاملRibbon Tilings From Spherical Ones
The problem of classifying all tile-k-transitive tilings of the innnite 2-dimensional ribbon (and pinched-ribbon) is shown to be solvable by classifying certain tile-k-transitive tilings of the sphere, for all k 2 N. Complete results are listed for k 3.
متن کاملQuantum Groups and Knot Theory: Week
One of the most important applications of the RT-functor is the construction of invariants of (closed, connected, oriented) 3-manifolds, the so-called Reshetikhin-Turaev-Witten invariants of 3-manifolds. However, the RT-invariants of ribbon links associated with colorings of links with objects of a ribbon category C in week 46 and week 47 are far too general for this purpose. For this more ambi...
متن کاملThe Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physical world. Recent experiments in self-assembly demonstrate its potential for the parallel creation of a large number of nanostructures, including possibly computers. A systematic study of self-assembly as a mathematical process has been initiated by L. Adleman and E. Win...
متن کاملPolyominoes simulating arbitrary-neighborhood zippers and tilings
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice, on the other side. A neighborhood N is a finite set of pairs (i, j) ∈ Z, indicating that the neighbors of a position (x, y) are the positions (x + i, y + j) for (i, j) ∈ N . This includes classical neighborhoods of si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997