Related papers: The domino problem is undecidable on surface group…
In this paper, we give a proof that it is undecidable whether a set of five polyominoes can tile the plane by translation. The proof involves a new method of labeling the edges of polyominoes, making it possible to assign whether two edges…
Let S be an immersed horizontal surface in a 3-dimensional graph manifold. We show that the fundamental group of the surface S is quadratically distorted whenever the surface is virtually embedded (i.e., separable) and is exponentially…
We solve a technical problem related to adeles on an algebraic surface. Given a finite set of natural numbers up to two, one associates an adelic group. We show that this operation commutes with taking intersections if the surface is…
We investigate when the fundamental group of the smooth part of a K3 surface or Enriques surface with Du Val singularities, is finite. As a corollary we give an effective upper bound for the order of the fundamental group of the smooth part…
We investigate data-enriched models, like Petri nets with data, where executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems in such models may depend on the…
A homshift is a $d$-dimensional shift of finite type which arises as the space of graph homomorphisms from the grid graph $\mathbb Z^d$ to a finite connected undirected graph $G$. While shifts of finite type are known to be mired by the…
We extend our discrete uniformization theorems for planar, $m$-connected, Jordan domains [Journal f\"ur die reine und angewandte Mathematik 670 (2012), 65--92] to closed surfaces of non-positive genus.
Given a projective surface and a generic projection to the plane, the braid monodromy factorization (and thus, the braid monodromy type) of the complement of its branch curve is one of the most important topological invariants, stable on…
We prove that the moduli space of numerical Godeaux surfaces with torsion group $\mathbb{Z}/2$ is irreducible and unirational of dimension 8. Moreover, we show that the topological fundamental group of these surfaces is also $\mathbb{Z}/2$.…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
Dependent Object Types (DOT) is a calculus with path dependent types, intersection types, and object self-references, which serves as the core calculus of Scala 3. Although the calculus has been proven sound, it remains open whether type…
We study unirationality of a Del Pezzo surface of degree two over a given (non algebraically closed) field, under the assumption that it admits at least one rational double point over an algebraic closure of the base field. As corollaries…
Expanding on work by Conway, Orson, and Powell, we study the isotopy classes rel. boundary of nonorientable, compact, locally flatly embedded surfaces in $D^4$ with knot group $\mathbb{Z}_2$. In particular we show that if two such surfaces…
We present a dichotomy for surface homeomorphisms in the isotopy class of the identity. We show that, in the absence of a degenerate fixed point set, either there exists a uniform bound on the diameter of orbits of non-wandering points for…
Let $G$ be the semidirect product $\Gamma \rtimes F_2$ where $\Gamma$ is either the free group $F_n$, $n > 1$ or the fundamental group $S_g$ of a closed surface of genus $g > 1$. We prove that $G$ is incoherent, solving two problems posed…
One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…
Let $C_2$ denote the cyclic group of order 2. We compute the $RO(C_2)$-graded cohomology of all $C_2$-surfaces with constant integral coefficients. We show when the action is nonfree, the answer depends only on the genus, the orientability…
We show that the word problem for an amalgam $[S_1,S_2;U,\omega_1,\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\mathcal{R}$-classes and $\omega_1,\omega_2$ to be…
Many fundamental problems in extremal combinatorics are equivalent to proving certain polynomial inequalities in graph homomorphism densities. In 2011, a breakthrough result by Hatami and Norine showed that it is undecidable to verify…
The first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on…