Related papers: Locked Polyomino Tilings
We present a single, connected tile which can tile the plane but only non-periodically. The tile is hexagonal with edge markings, which impose simple rules as to how adjacent tiles are allowed to meet across edges. The first of these rules…
Near-degenerate resonance poles arise widely in open-wave systems. For gravitational-wave ringdowns, inference is performed on finite time windows where neighboring quasinormal modes can be spectrally close; the waveform is then dominated…
A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating…
We investigate the properties of classical single flip dynamics in sets of two-dimensional random rhombus tilings. Single flips are local moves involving 3 tiles which sample the tiling sets {\em via} Monte Carlo Markov chains. We determine…
A rep-tile is a polygon that can be dissected into smaller copies (of the same size) of the original polygon. A polyomino is a polygon that is formed by joining one or more unit squares edge to edge. These two notions were first introduced…
This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of…
The mim-width of a graph is a powerful structural parameter that, when bounded by a constant, allows several hard problems to be polynomial-time solvable - with a recent meta-theorem encompassing a large class of problems [SODA2023]. Since…
Topologically interlocked material systems are two-dimensional assemblies of unit elements from which no element can be removed from the assembly without disassembly of the entire system. Consequently, such tile assemblies are able to carry…
Given a graph, when can we orient the edges to satisfy local constraints at the vertices, where each vertex specifies which local orientations of its incident edges are allowed? This family of graph orientation problems is a special kind of…
We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that this variant is undecidable regardless of the shapes,…
We explore the interplay between t-structures in the bounded derived category of finitely presented modules and the unbounded derived category of all modules over a coherent ring $A$ using homotopy colimits. More precisely, we show that…
This paper provides explicit justification for a method of canonical scalings of tilings of euclidean spaces. We present a new combinatorially-geometrical approach for constructing a generatriss of a tiling. The approach is based on an…
Grid diagrams are special representations of knots in the three-sphere that are used to define a combinatorial version of knot Floer homology. Paolo Ghiggini and Yi Ni showed that knot Floer homology detects fibered knots. Their results…
It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to higher-dimensional sandpile groups, the second author discovered a novel construction which fragments the…
Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known…
We study tilings of rectangular boards using unit squares together with a single type of big tile shaped as a Ferrers diagram. We derive generating functions for these tilings, prove real-rootedness and interlacing properties of associated…
This paper surveys recent advances in the area of very large MIMO systems. With very large MIMO, we think of systems that use antenna arrays with an order of magnitude more elements than in systems being built today, say a hundred antennas…
We prove that the classic falling-block video game Tetris (both survival and board clearing) remains NP-complete even when restricted to 8 columns, or to 4 rows, settling open problems posed over 15 years ago [BDH+04]. Our reduction is from…
We construct well-formed and quasismooth terminal Fano 4-folds of index 1 in low codimension containing at worst isolated orbifold points. We provide a certain classification of these varieties where their images under the anitcanonical…
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…