Related papers: Shuffling algorithm for coupled tilings of the Azt…
We use the octahedron recurrence, which generalizes the quadratic recurrence found by Kuo for standard Aztec diamonds, in order to compute boundary one-refined and two-refined partition functions for two-periodic Aztec diamonds. In a first…
We introduce a smoothing algorithm for triangle, quadrilateral, tetrahedral and hexahedral meshes whose centerpiece is a simple geometric triangle transformation. The first part focuses on the mathematical properties of the element…
In a recent paper, Lai and Rohatgi proved a "shuffling theorem" for lozenge tilings of a hexagon with "dents" (i.e., missing triangles). Here, we shall point out that this follows immediately from the enumeration of Gelfand--Tsetlin…
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we give an algorithm linear in the number of columns. Some…
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…
We present a general approach for the study of dimer model limit shape problems via variational and integrable systems techniques. In particular we deduce the limit shape of the Aztec diamond and the hexagon for quasi-periodic weights…
We consider the triangular lattice ice model (20-Vertex model) with four types of domain-wall type boundary conditions. In types 1 and 2, the configurations are shown to be equinumerous to the quarter-turn symmetric domino tilings of an…
We consider tilings of quadriculated regions by dominoes and of triangulated regions by lozenges. We present an overview of results concerning tileability, enumeration and the structure of the space of tilings.
The first author recently introduced toric promotion, an operator that acts on the labelings of a graph $G$ and serves as a cyclic analogue of Sch\"utzenberger's promotion operator. Toric promotion is defined as the composition of certain…
An algorithm is provided to tile the plane with the aperiodic monotile Tile(1,1) recently discovered by Smith et al. (2023). Their geometric construction guidelines are expanded into a numerical MATLAB algorithm. The intention is to remove…
In this article, a novel cluster analysis algorithm was employed in the study of polymer coil to globule transition via single chain Monte Carlo simulations. The algorithm, which has been recently applied in Molecular Dynamics simulations…
We study the correlation functions for determinantal point processes defined by products of infinite minors of block Toeplitz matrices. The motivation for studying such processes comes from doubly periodically weighted tilings of planar…
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…
We define a convolution operation on the set of polyominoes and use it to obtain a criterion for a given polyomino not to tile the plane (rotations and translations allowed). We apply the criterion to several families of polyominoes, and…
In this paper, we consider the set of all domino tilings of a cubiculated region. The primary question we explore is: How can we move from one tiling to another? Tiling spaces can be viewed as spaces of subgraphs of a fixed graph with a…
Pole-swapping algorithms, which are generalizations of the QZ algorithm for the generalized eigenvalue problem, are studied. A new modular (and therefore more flexible) convergence theory that applies to all pole-swapping algorithms is…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
This article extends Scholze's six functor formalism for diamonds to a very general class of stacky morphisms between v-stacks, using $\infty$-categorical techniques developed by Liu-Zheng.
We give a $O(n)$-time algorithm for determining whether translations of a polyomino with $n$ edges can tile the plane. The algorithm is also a $O(n)$-time algorithm for enumerating all such tilings that are also regular, and we prove that…
This article is dedicated to domino tilings of square grids. In each of these grids domino tilings are represented using linear-recurrent sequences. For different grids are determined new dependencies.