Related papers: Addendum to "Tilings problems on Baumslag-Solitar …

Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…

Given a lattice $\Gamma \subset SOL$, we show that there is a coarsely dense subset $\mathcal{D} \subset \Gamma$ that is not biLipschitz equivalent to $\Gamma$. We also prove similar results for lattices in certain higher rank…

The Baumslag-Solitar groups: BS(m,n)=<x,y| x y^{m} x^{-1} = y^{n}> are some of the simplest interesting infinite groups which are not lattices in Lie groups. They have been studied in depth from the point of view of combinatorial group…

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 prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.

The Diophantine problem for a monoid $M$ is the decision problem to decide whether any given system of equations has a solution in $M$. In this note, we give a simple example of a context-free, word-hyperbolic, finitely presented, special…

In this article, we study the fixed-point subgroups of the solvable Baumslag-Solitar groups $\BS(1,n)= \langle a, t \mid t a t^{-1} = a^{n} \rangle$, $n>1$ of automorphisms and endomorphisms. We also investigate the stabilizers of subgroups…

We characterize the virtually nilpotent finitely generated groups (or, equivalently by Gromov's theorem, groups of polynomial growth) for which the Domino Problem is decidable: These are the virtually free groups, i.e. finite groups, and…

In this paper, we prove that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael…

We compute the Bieri-Neumann-Strebel invariants $\Sigma^1$ for the generalized solvable Baumslag-Solitar groups $\Gamma_n$ and their finite index subgroups. Using $\Sigma^1$, we show that certain finite index subgroups of $\Gamma_n$ cannot…

Recently, Greenfeld and Tao disprove the conjecture that translational tilings of a single tile can always be periodic [Ann. Math. 200(2024), 301-363]. In another paper [to appear in J. Eur. Math. Soc.], they also show that if the dimension…

We prove that metabelian Baumslag$-$Solitar group $BS(1,k)$, $k>1$, is (strongly) regularly bi-interpretable with the ring of integers $\mathbb{Z}$, and describe in algebraic terms all groups that are elementarily equivalent to $BS(1,k)$.

The rewriting system sigma is the set of rules propagating explicit substitutions in the lambda-calculus with explicit substitutions. In this note, we prove the undecidability of unification modulo sigma.

Aperiodic tilings are non-periodic tilings characterized by local constraints. They play a key role in the proof of the undecidability of the domino problem (1964) and naturally model quasicrystals (discovered in 1982). A central question…

We prove that each residually finite Baumslag-Solitar group can be distinguished by its finite quotients from all other residually finite Baumslag-Solitar groups.

We prove, for every non-virtually free hyperbolic group $G$, that there is no algorithm that, given a finite collection of dominoes, determines whether the Cayley graph of $G$ may be edge-covered by these dominoes so that colours match at…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

Let $m$ and $k$ be integers such that $|m|, \, |k| >1$ and $\gcd (m,k)=1$. We show that all Baumslag-Solitar groups $BS(m,mk)$ are non-residually finite groups hyperbolic relative to residually finite subgroups. By a result of Osin (2007),…

We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the…