Related papers: Rectangular tileability and complementary tileabil…

In this document, we collected the most important complexity results of tilings. We also propose a definition of a so-called deterministic set of tile types, in order to capture deterministic classes without the notion of games. We also…

We study the computational complexity of a robust version of the problem of testing two univariate C-finite functions for eventual inequality at large times. Specifically, working in the bit-model of real computation, we consider the…

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

This paper gives new solutions to the problem: 'Can we construct monohedral tilings of the disk such that a neighbourhood of the origin has trivial intersection with at least one tile?'

Aperiodic tiling is a well-know area of research. First developed by mathematicians for the mathematical challenge they represent and the beauty of their resulting patterns, they became a growing field of interest when their practical use…

This paper deals with the history of the following problem: "Can an arbitrary rectangle be dissected into 3 non-rectangular congruent regions?" We present a new elementary proof that the answer is indeed no.

It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.

We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…

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…

We introduce a tiling problem between bounded open convex polyforms $\hat{P}\subset\mathbb{R}^2$ with directed and uniquely colored edges. If there exists a tiling of the polyform $\hat{P}_2$ by $\hat{P}_1$, we show that one can construct a…

Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

We obtain tilings with a singular point by applying conformal maps on regular tilings of the Euclidean plane, and determine its symmetries. The resulting tilings are then symmetrically colored by applying the same conformal maps on…

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

The problem of deciding, given a complex variety X, a point x in X, and a subvariety Z of X, whether there is an automorphism of X mapping x into Z is proved undecidable. Along the way, we prove the undecidability of a version of Hilbert's…

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…