Related papers: Shuffling algorithm for coupled tilings of the Azt…
An overview of the current status of algorithmic approaches to dynamical overlap fermions is given. In particular the issue of changing the topological sector is discussed.
We describe a number of recently developed cluster-flipping algorithms for the efficient simulation of classical spin models near their critical temperature. These include the algorithms of Wolff, Swendsen and Wang, and Niedermeyer, as well…
In their unpublished work, Jockusch and Propp showed that a 2-enumeration of antisymmetric monotone triangles is given by a simple product formula. On the other hand, the author proved that the same formula counts the domino tilings of the…
In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). We show that many…
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston's height function approach to a nearly…
We demonstrate that the Kibble-Zurek mechanism (KZM) holds for open systems transitioning from a disordered phase to a discrete time crystal (DTC). Specifically, we observe the main signatures of the KZM when the system is quenched into a…
Previous Monte Carlo investigations by Wojciechowski \emph{et al.} have found two unusual phases in two-dimensional systems of anisotropic hard particles: a tetratic phase of four-fold symmetry for hard squares [Comp. Methods in Science and…
We investigate tilings of cubiculated regions with two simply connected floors by 2 x 1 x 1 bricks. More precisely, we study the flip connected component for such tilings, and provide an algebraic invariant that "almost" characterizes the…
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…
Kenyon and Pemantle (2014) gave a formula for the entries of a square matrix in terms of connected principal and almost-principal minors. Each entry is an explicit Laurent polynomial whose terms are the weights of domino tilings of a half…
The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of the Domino problem: given as input a family of forbidden…
This paper is on tilings of polygons by rectangles. A celebrated physical interpretation of such tilings due to R.L. Brooks, C.A.B. Smith, A.H. Stone and W.T. Tutte uses direct-current circuits. The new approach of the paper is an…
Here presented is a unified approach to Stirling numbers and their generalizations as well as generalized Stirling functions by using generalized factorial functions, $k$-Gamma functions, and generalized divided difference. Previous…
Recently Taylor and Socolar introduced an aperiodic mono-tile. The associated tiling can be viewed as a substitution tiling. We use the substitution rule for this tiling and apply the algorithm of \cite{AL} to check overlap coincidence. It…
A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems with polyomino pieces and a polyomino container $P$. We give…
The Tangent Method of Colomo and Sportiello is applied to the study of the asymptotics of domino tilings of large Aztec rectangles, with some fixed distribution of defects along a boundary. The associated Non-Intersecting Lattice Path…
This paper is about the tiling dynamical systems approach to the study of aperiodic order. We compare and contrast four related types of systems: ordinary (one-dimensional) symbolic systems, one-dimensional tiling systems, multidimensional…
We propose a novel computational strategy to study the glass transition of molecular fluids. Our approach combines the construction of simple yet realistic models with the development of Monte Carlo algorithms to accelerate equilibration…
The switching model is a Markov chain approach to sample graphs with fixed degree sequence uniformly at random. The recently invented Curveball algorithm for bipartite graphs applies several switches simultaneously (`trades'). Here, we…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…