Related papers: Decision problems on geometric tilings

We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in $\mathbb{R}^3$. We show that this question, which is equivalent to deciding the emptiness of certain…

We study single-flip dynamics in sets of three-dimensional rhombus tilings with fixed polyhedral boundaries. This dynamics is likely to be slowed down by so-called ``cycles'': such structures arise when tilings are encoded via the…

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

We define sets of coulourings of the infinite discrete plane using monadic second order (MSO) formulas. We determine the complexity of deciding whether such a formula defines a subshift, parametrized on the quantifier alternation complexity…

We examine Li's double determinantal varieties in the special case that they are toric. We recover from the general double determinantal varieties case, via a more elementary argument, that they are irreducible and show that toric double…

We construct a finitely dimensional invariant manifold of holomorphic discs attached to a certain class of smooth pseudconvex hypersurfaces of finite type in $\C^2$, generalizing the notion of stationary discs. The discs we construct are…

We show that a wide range of overdetermined boundary problems for semilinear equations with position-dependent nonlinearities admits nontrivial solutions. The result holds true both on the Euclidean space and on compact Riemannian…

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?'

To study the fixed parameter undecidability of tiling problem for a set of Wang tiles, Jeandel and Rolin show that the tiling problem for a set of 44 Wang bars is undecidable. In this paper, we improve their result by proving that whether a…

Using recent machine learning results that present an information-theoretic perspective on underfitting and overfitting, we prove that deciding whether an encodable learning algorithm will always underfit a dataset, even if given unlimited…

The H^2-regularity of variational solutions to a two-dimensional transmission problem with geometric constraint is investigated, in particular when part of the interface becomes part of the outer boundary of the domain due to the saturation…

Fix a finite group $G$. We seek to classify varieties with $G$-action equivariantly birational to a representation of $G$ on affine or projective space. Our focus is odd-dimensional smooth complete intersections of two quadrics, relating…

We prove that the inhabitation problem for rank two intersection types is decidable, but (contrary to common belief) EXPTIME-hard. The exponential time hardness is shown by reduction from the in-place acceptance problem for alternating…

Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…

Let n integer greater or equal to 4 and even and let T_n be the set of ribbon L-shaped n-ominoes. We study tiling problems for regions in a square lattice by T_n. Our main result shows a remarkable rigidity property: a tiling of the first…

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…

In this study, we investigate the computational complexity of some variants of generalized puzzles. We are provided with two sets S_1 and S_2 of polyominoes. The first puzzle asks us to form the same shape using polyominoes in S_1 and S_2.…

In a locally finite tiling of n-dim Euclidean space by convex polytopes, each point of the space is either a vertex of at least two tiles, or no vertex at all.

This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost…

We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we show hardness of a classical tiling problem on an N x N…