Related papers: The domino problem is decidable for robust tileset…
We establish the undecidability of conditional affine information inequalities, the undecidability of the conditional independence implication problem with a constraint that one random variable is binary, and the undecidability of the…
The logic of bunched implications (BI), introduced by O'Hearn and Pym (1999), has attracted significant attention due to its elegant proof calculus, varied semantics, and close connections to the propositional fragment of separation logic.…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
We apply domino problems to give short proofs for some known theorems for the classical predicate logic and to obtain lower bounds for complexity of modal predicate logics defined by Noetherian orders as Kripke frames.
Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…
Our goal is to prove new results in graph theory and combinatorics thanks to the speed of computers, used with smart algorithms. We tackle four problems. The four-colour theorem states that any map whose countries are connected can be…
We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…
TThe prototypical problem we study here is the following. Given a $2L\times 2L$ square, there are approximately $\exp(4KL^2/\pi )$ ways to tile it with dominos, i.e. with horizontal or vertical $2\times 1$ rectangles, where $K\approx 0.916$…
Every body knows that identical regular triangles or squares can tile the whole plane. Many people know that identical regular hexagons can tile the plane properly as well. In fact, even the bees know and use this fact! Is there any other…
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…
Three results are shown on producibility in the hierarchical model of tile self-assembly. It is shown that a simple greedy polynomial-time strategy decides whether an assembly A is producible. The algorithm can be optimized to use O(|A|…
Kwasniewski's cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation…
The number of distinguishable inherent structures of a liquid is the key component to understanding the thermodynamics of glass formers. In the case of hard potential systems such as hard discs, spheres and ellipsoids, an inherent structure…
This paper provides a bridge between the classical tiling theory and the complex neighborhood self-assembling situations that exist in practice. The neighborhood of a position in the plane is the set of coordinates which are considered…
Several articles deal with tilings with squares and dominoes of the well-known regular square mosaic in Euclidean plane, but not any with the hyperbolic regular square mosaics. In this article, we examine the tiling problem with colored…
We show that, for every finitely generated group with decidable word problem and undecidable domino problem, there exists a sequence of effective subshifts whose inverse limit is not the topological factor of any effective dynamical system.…
In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal')…
We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of…
An approach to homogenization of high porosity metallic foams is explored. The emphasis is on the \Alporas{} foam and its representation by means of two-dimensional wire-frame models. The guaranteed upper and lower bounds on the effective…
Koutschan, Krattenthaler and Schlosser recently considered a family of binomial determinants. In this work, we give combinatorial interpretations of two subclasses of these determinants in terms of domino tilings and nonintersecting lattice…